观察可以发现 最深叶子节点的公共祖先左右子树的高度一定相等,这个是解题的关键(这个很好理解,如果左右子树不等高,那么左右子树最深的节点一定不等高,就不满足“最深”这个条件,同理也可以想到,最深的叶子节点一定在高度更高的那颗树上面)
接下来就简单了:调用关于计算树深度的算法,递归那个更高的子树
注意return lcaDeepestLeaves(root.left);写法与直接return null的区别。
/**
* @Description 我们写代码,靠的是技术(狗头)
* @auther admin
* @create 2020-06-23 12:59
*/
public class Solution1123 {
public static class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode(int x) { val = x; }
}
/**
* @param root
* @return
*/
public TreeNode lcaDeepestLeaves(TreeNode root) {
int left = getDepth(root.left);
int right = getDepth(root.right);
if(left==right){
return root;
}
else if(left>right){
return lcaDeepestLeaves(root.left);
}
else
{
return lcaDeepestLeaves(root.right);
}
}
public int getDepth(TreeNode root){
if(root==null)return 0;
int l = 0,r =0;
if(root.left!=null)
l = getDepth(root.left);
if(root.right!=null)
r = getDepth(root.right);
return l>r?l+1:r+1;
}
public static void main(String[] args) {
TreeNode root = new TreeNode(1);
root.left = new TreeNode(2);
root.right = new TreeNode(3);
root.left.left = new TreeNode(4);
Solution1123 solution1123 = new Solution1123();
System.out.println(solution1123.lcaDeepestLeaves(root).val);
}
}