dsa2 min read
Construct Binary Search Tree from Preorder Traversal
Reconstruct a BST from its preorder traversal in O(n) using min-max bounds to place each node.
Read →
All Posts
1276 articles
dsa2 min read
Find Leaves of Binary Tree
Collect leaves by height (distance from leaf) repeatedly, returning all leaves at each height level.
Read →
dsa2 min read
Count Complete Tree Nodes
Count nodes in a complete binary tree in O(log^2 n) by comparing left and right heights to identify full subtrees.
Read →
dsa2 min read
Minimum Time to Collect All Apples in a Tree
Find minimum seconds to collect all apples in a tree by DFS: include a subtree path only if it contains apples.
Read →
dsa2 min read
Maximum Difference Between Node and Ancestor
Find the maximum |a - b| for any ancestor-descendant pair by tracking min and max values along each root-to-leaf path.
Read →
Page 106 of 256