Lca

3 articles

dsa1 min read

Find the LCA of two nodes using post-order DFS: return root when found, propagate upward and split at the ancestor.

March 19, 2026Read →

dsa1 min read

Find the LCA in a BST in O(h) by navigating left or right based on whether both nodes are in the same subtree.

March 19, 2026Read →

dsa3 min read

Find path directions between two tree nodes by finding LCA then building paths from LCA to each target.

March 19, 2026Read →