Traversal

• We can perform in-order (and even pre-order or post-order traversals in nearly the same fashion...

  • In-order traversal pseudo-code
    • Recursively traverse the left subtree Tl.
    • Visit the current node's left item Ia.
    • If the middle subtree is not empty then
      • Recursively traverse the middle subtree Tm
      • Visit the current node’s right item Ib
    • Recursively traverse the right subtree Tr.