Binary Trees & Traversal

Preorder, inorder, postorder, and level order, recursive vs iterative traversal, rebuilding trees, and height vs depth.

0 / 8 solved
0/8 solved
Question Tags Difficulty Success
2. Stack Machine Feed
binary-treetraversal +2
Easy 70%
3. Two Sequences One Tree
binary-treetraversal +1
Medium —
4. What The Stack Holds
binary-treeinorder-traversal +2
Medium —
5. Height Called Everywhere
binary-treeheight +2
Medium 40%
6. Enough To Rebuild
binary-treetraversal +1
Medium 20%
7. One Missing Branch
binary-treetraversal +2
Hard —
8. Ancestor In Constant Time
binary-treetraversal-numbering +1
Hard —

Up next

8 of 8 questions here are still unsolved.