Binary Tree Traversals
Inorder:
- Definition: left child, visit, right child (recursive)
- Algorithm: depth-first search (visit between children)
- Can be defined for any tree (visit after first child), usually limited to
binary case
-
Illustration
Other traversals apply to binary case:
|