Treesintro
In-order Traversal
Visits left subtree, then the node, then the right subtree. On a binary search tree this yields the keys in fully sorted order — the defining property of in-order traversal.
- Best
- O(n)
- Average
- O(n)
- Worst
- O(n)
- Space
- O(h)
Visits left subtree, then the node, then the right subtree. On a binary search tree this yields the keys in fully sorted order — the defining property of in-order traversal.