Modified Lowest Common Ancestor in BST
Filed under PayU
The question
Write a complete working code with boundary conditions to find a modified lowest common ancestor of two nodes in a Binary Search Tree.
No write-up yet. Related questions below have one.
Related PayU questions
Collected from public candidate posts and coding forums. Updated Nov 2026.