visit(node)
for each child of node
traverse(child)
visit(B)
visit(D)
visit(E)
visit(F)
visit(C)
Traversing a tree == visiting all nodes recursively
"Visiting" a node == performing some function on the node & its data
|
traverse(node): visit(node) for each child of node traverse(child) |
visit(A) visit(B) visit(D) visit(E) visit(F) visit(C) |
|