Lowest Common Ancestor of a BST · Coding Interview Practice

Lowest Common Ancestor of a BSTGiven a binary search tree and two nodes, return their lowest common ancestor.Constraints

The number of nodes is in the range [2, 10^5]

All Node.val are unique

p and q exist in the BST

Examples

Input: root = [6,2,8,0,4,7,9], p = 2, q = 8 Output: 6

Input: root = [6,2,8,0,4,7,9], p = 2, q = 4 Output: 2

LetsDiscuss

Loading your session…