题解 | #二叉搜索树的最近公共祖先#
二叉搜索树的最近公共祖先
https://www.nowcoder.com/practice/d9820119321945f588ed6a26f0a6991f
import java.util.*; /* * public class TreeNode { * int val = 0; * TreeNode left = null; * TreeNode right = null; * public TreeNode(int val) { * this.val = val; * } * } */ public 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 if(root==null){ return -1; } int a = Math.max(p,q); int b = Math.min(p,q); if(b<=root.val && a>=root.val){ return root.val; }else{ int m = lowestCommonAncestor(root.left,a,b); int n = lowestCommonAncestor(root.right,a,b); return Math.max(m,n); } } }