Binary Tree
Each node has at most two children. Every tree lesson here builds on this shape.
Tree Traversals: Inorder comes out sorted
Walk this tree in inorder order: left subtree, then the node, then the right subtree.
Cost
- Traverse
- O(n)
- Height
- O(n)
- Space
- O(n)
Before this
Leads to
Topics that need this one first.
Taught by the same lesson
Tree Traversals covers these too, in the same run.