二叉搜索树的最近公共祖先

给定一个二叉搜索树, 找到该树中两个指定节点的最近公共祖先。

input: root = [6,2,8,0,4,7,9,null,null,3,5], p = 2, q = 8
output: 6 

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */

class Solution {
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        TreeNode temp = root;
        while(true){
            if(p.val < temp.val && q.val < temp.val){
                temp = temp.left;
            } else if(p.val > temp.val && q.val > temp.val){
                temp = temp.right;
            } else{
                break;
            }
        }
        return temp;
    }
}