Important Tree Algorithms/Questions for Harder Interviews

Some companies are ask especially difficult tree-related questions during interviews. For that, I’m compiling a list of important tree problems hoping this list will help me find problems that I misse

Some companies are ask especially difficult tree-related questions during interviews. For that, I’m compiling a list of important tree problems hoping this list will help me find problems that I missed out in my prep. Criteria: * Must be a classic question that teaches a specific tree concept well * Or a commonly asked hard tree question in interviews I’ll keep updating this list over time. If I’ve missed any must-practice problems, feel free to share them in the comments! 1. Inorder/Preorder/Postorder/Morris (recursive, iterative) 2. Left/Right/Top/Bottom/Diagonal Views 3. Height/Diameter of Tree 4. Largest, Higherst etc Path in Tree 5. Path Sum 1, 2, 3 6. Unique Binary Tree/Symmetric Tree 7. Serializ, deserialize tree 8. Bst/is Bst 9. Avl/Red Black 10. LCA 11. Binary Lifting LCA 12. Euler Tour on Trees 13. DP on Trees / Rerooting (*) 14. Heavy Light Decomposition (for queries) (Very very very Optional) Good Resources to Follow : usaco.guide, cses, leetcode