Lowest Common Ancestor in a Binary Search Tree

amazon Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes p and q. The LCA is defined between two nodes p and q as the lowest node in T that has both p and q as descendants (where we allow a node to be a descendant of itself). Input: root: Root node of the binary search tree. p: Node p. q: Node q. Output: Return the lowest common ancestor of nodes p and q. Assumptions: All the node values in the tree are unique. p and q are nodes in the tree and both exist. Test Cases: # Example 1: # Input: root = [6,2,8,0,4,7,9,null,null,3,5], p = 2, q = 8 # Output: 6 # Example 2: # Input: root = [6,2,8,0,4,7,9,null,null,3,5], p = 2, q = 4 # Output: 2 Example Input [6,2,8,0,4,7,9,null,null,3,5] 2 8