1123. Lowest Common Ancestor of Deepest Leaves (Medium)

Description:

Given a rooted binary tree, return the lowest common ancestor of its deepest leaves.

Recall that:

• The node of a binary tree is a leaf if and only if it has no children
• The depth of the root of the tree is 0, and if the depth of a node is d, the depth of each of its children is d+1.
• The lowest common ancestor of a set S of nodes is the node A with the largest depth such that every node in S is in the subtree with root A.

Example 1:

Input: root = [1,2,3]
Output: [1,2,3]
Explanation: 
The deepest leaves are the nodes with values 2 and 3.
The lowest common ancestor of these leaves is the node with value 1.
The answer returned is a TreeNode object (not an array) with serialization "[1,2,3]".

Example 2:

Input: root = [1,2,3,4]
Output: [4]
Example 3:

Example 3:

Input: root = [1,2,3,4,5]
Output: [2,4,5]

Constraints:

• The given tree will have between 1 and 1000 nodes.
• Each node of the tree will have a distinct value between 1 and 1000.

---

Analysis:

The solution to the problem is the same with LeetCode 865. Smallest Subtree with all the Deepest Nodes.

---

Code:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public TreeNode subtreeWithAllDeepest(TreeNode root) {
        if(root == null) {
            return null;
        }else{
            int leftHeight = getHeight(root.left);
            int rightHeight = getHeight(root.right);
            if(leftHeight == rightHeight) {
                return root;
            }else if(leftHeight < rightHeight) {
                return subtreeWithAllDeepest(root.right);
            }else {
                return subtreeWithAllDeepest(root.left);
            } 
        }
    }
    
    public int getHeight(TreeNode node) {
        if(node == null) {
            return 0;
        }else{
            int leftHeight = 0;
            int rightHeight = 0;
            if(node.left != null) {
                leftHeight = getHeight(node.left);
            }
            if(node.right != null) {
                rightHeight = getHeight(node.right);
            }
            
            int height = 1 + Math.max(leftHeight, rightHeight);
            
            return height;
        }
    }
}