public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) { if((root.val-p.val)*(root.val-q.val)<=0) return root; if(p.val<root.val&&q.val<root.val) return lowestCommonAncestor(root.left,p,q); return lowestCommonAncestor(root.right,p,q); }
递归
原文：https://www.cnblogs.com/taoyuxin/p/13544530.html