save_load_test.ipynb
Cell 1 — code
25 stroke(s)
print('SMILE')
print('KITTY')

SILE
KITTY
Cell 2 — markdown
14 stroke(s)

Introduction to DFS:

DFS is a __ algorithm using a __ If we had the following tree, what order would we visit our nodes in?

This is different from BFS where we use a __

Cell 3 — code
0 stroke(s)
def dfs(g):
Cell 4 — code
0 stroke(s)