LeetCode - Medium - 1123

最新推荐文章于 2024-09-14 18:52:56 发布

2401_85112269

最新推荐文章于 2024-09-14 18:52:56 发布

阅读量837

点赞数 16

文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/2401_85112269/article/details/139845724

版权

Description

Given the root of a 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. 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.

Note: This question is the same as 865: https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes/

Example 1:

在这里插入图片描述

Input: root = [3,5,1,6,2,0,8,null,null,7,4]

Output: [2,7,4]

Explanation: We return the node with value 2, colored in yellow in the diagram.

The nodes coloured in blue are the deepest leaf-nodes of the tree.

Note that nodes 6, 0, and 8 are also leaf nodes, but the depth of them is 2, but the depth of nodes 7 and 4 is 3.

Example 2:

Input: root = [1]

Output: [1]

Explanation: The root is the deepest node in the tree, and it’s the lca of itself.

Example 3:

Input: root = [0,1,3,null,2]

Output: [2]

Explanation: The deepest leaf node in the tree is 2, the lca of one node is itself.

Constraints:

The number of nodes in the tree will be in the range [ 1 , 1000 ] [1, 1000] [1,1000].
0 < = N o d e . v a l < = 1000 0 <= Node.val <= 1000 0<=Node.val<=1000
The values of the nodes in the tree are unique.

Analysis

方法一：自己写的，用后序遍历模式

方法二：别人写的，用后序遍历模式

Submission

import com.lun.util.BinaryTree.TreeNode;

public class LowestCommonAncestorOfDeepestLeaves {

//方法一：自己写的，用后序遍历模式

public TreeNode lcaDeepestLeaves(TreeNode root) {

Object[] result = lcaDeepestLeaves(root, 0);

return result != null ? (TreeNode)result[0] : null;

}