Lowest Common Ancestor of a Binary Search Tree

Given a Binary Search Tree (BST) and two node values `p` and `q`, find the value of their **Lowest Common Ancestor (LCA)**. The lowest common ancestor 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). ### Constraints - The number of nodes in the tree is in the range `[2, 10^5]`. - `-10^9 <= Node.val <= 10^9` - All `Node.val` are unique. - `p != q` - `p` and `q` exist in the BST. ### Input Format First line contains space-separated integers representing the BST in level-order (-1 for null). Second line contains two space-separated integers `p` and `q`. ### Output Format Print the integer value of the LCA node.