Tree Traversal
Iteration (traversal) on …
-
Lists … visit each value, from first to last
-
Graphs … visit each vertex, order determined by DFS/BFS/…
For binary Trees, several well-defined visiting orders exist:
- preorder (NLR) … visit root, then left subtree, then right subtree
- inorder (LNR) … visit left subtree, then root, then right subtree
- postorder (LRN) … visit left subtree, then right subtree, then root
- level-order … visit root, then all its children, then all their children
|
![[prev]](icon/prev.gif){kind=icon}
![[next]](icon/next.gif){kind=icon}