题解 | #二叉搜索树的最近公共祖先#
二叉搜索树的最近公共祖先
http://www.nowcoder.com/practice/d9820119321945f588ed6a26f0a6991f
import java.util.*; public class Solution { public int lowestCommonAncestor (TreeNode root, int p, int q) { if(root.val>p&&root.val>q){ return lowestCommonAncestor(root.left,p,q); } if(root.val<p&&root.val<q){ return lowestCommonAncestor(root.right,p,q); } if(root.val==p) return p; return root.val; } }