Trees & BST
Recursive thinking on hierarchical data: traversals, height-based DFS, BST ordering, and tree reconstruction.
Solved
0/14
1Binary Tree Inorder TraversalDFS · StackEasy2Maximum Depth of Binary TreeDFS · BFSEasy3Invert Binary TreeDFSEasy4Diameter of Binary TreeDFS · Tree DPEasy5Binary Tree Level Order TraversalBFSMedium6Binary Tree Zigzag Level Order TraversalBFSMedium7Binary Tree Right Side ViewBFS · DFSMedium8Validate Binary Search TreeBST · DFSMedium9Kth Smallest Element in a BSTBST · InorderMedium10Lowest Common Ancestor of a Binary TreeDFS · LCAMedium11Construct Binary Tree from Preorder and Inorder TraversalDivide and Conquer · Hash MapMedium12Binary Tree Maximum Path SumDFS · Tree DPHard13Vertical Order Traversal of a Binary TreeBFS · SortingHard14Serialize and Deserialize Binary TreeDFS · DesignHard