题解 | #二叉搜索树的最近公共祖先#

using System;
using System.Collections.Generic;

/*
public class TreeNode
{
	public int val;
	public TreeNode left;
	public TreeNode right;

	public TreeNode (int x)
	{
		val = x;
	}
}
*/

class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param root TreeNode类 
     * @param p int整型 
     * @param q int整型 
     * @return int整型
     */
    public int lowestCommonAncestor (TreeNode root, int p, int q) {
        // write code here
        while(root != null){
            if(root.val > p && root.val > q){
                root = root.left;
            }else if(root.val < p && root.val < q){
                root = root.right;
            }else{
                return root.val;
            }
        }
        return 0;
    }
}