dsa3 min read
Kth Ancestor of a Tree Node
Find the Kth ancestor of any tree node in O(log k) per query using binary lifting (sparse table DP).
Read →
All Posts
1575 articles
dsa2 min read
Binary Tree Maximum Path Sum
Find the maximum path sum in a binary tree where the path can start and end at any node.
Read →
dsa2 min read
Serialize and Deserialize Binary Tree
Serialize a binary tree to string and back using BFS level-order or DFS preorder with null markers.
Read →
dsa2 min read
Maximum Sum BST in Binary Tree
Find the maximum sum of any BST subtree within a binary tree using post-order DFS returning subtree metadata.
Read →
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 →
Page 165 of 315