S+

Traversal

0 / 8

94Binary Tree Inorder TraversalInorder144Binary Tree Preorder TraversalPreorder145Binary Tree Postorder TraversalPostorder102Binary Tree Level Order TraversalBFS level order103Binary Tree Zigzag Level Order TraversalBFS + flip199Binary Tree Right Side ViewBFS level order662Maximum Width of Binary TreeBFS + index987Vertical Order Traversal of a Binary TreeBFS + sorting

S+

Basic Operations

0 / 11

226Invert Binary TreeRecursion104Maximum Depth of Binary TreeRecursion543Diameter of Binary TreePostorder recursion110Balanced Binary TreePostorder recursion100Same TreeRecursion572Subtree of Another TreeRecursion101Symmetric TreeDouble recursion mirror222Count Complete Tree NodesBinary Search + tree height1448Count Good Nodes in Binary TreeDFS1325Delete Leaves With a Given ValuePostorder recursion129Sum Root to Leaf NumbersDFS + path sum

A

BST

0 / 6

235Lowest Common Ancestor of a BSTBST property701Insert into a BSTBST basics450Delete Node in a BSTBST basics98Validate Binary Search TreeBST property230Kth Smallest Element in a BSTInorder108Convert Sorted Array to Binary Search TreeBST build (D&C)

S+

Advanced / LCA

0 / 13

105Construct Binary Tree from Preorder and Inorder TraversalReconstruction236Lowest Common Ancestor of a Binary TreeLCA classic1644LCA of a Binary Tree IILCA variant (node may not exist)2096Step-By-Step Directions From a Binary Tree Node to AnotherLCA + path build863All Nodes Distance K in Binary TreeTree → Graph + BFS366Find Leaves of Binary TreeLevel-order peeling1367Linked List in Binary TreeDFS + matching545Boundary of Binary TreeDFS segmented427Construct Quad TreeDivide & Conquer1110Delete Nodes And Return ForestPostorder recursion + set114Flatten Binary Tree to Linked ListPreorder recursion (in-place)124Binary Tree Maximum Path SumPostorder recursion297Serialize and Deserialize Binary TreeDFS preorder (null markers)

ViewEdit