[LeetCode] 1123. Lowest Common Ancestor of Deepest Leaves 最
发布时间:2020-12-14 05:09:11 所属栏目:大数据 来源:网络整理
导读: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
Recall that:
Example 1: Input: root = [1,2,3] Output: [1,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,3]". Example 2: Input: root = [1,3,4] Output: [4] Example 3: Input: root = [1,4,5] Output: [2,5] Constraints:
https://github.com/grandyang/leetcode/issues/1123
Lowest Common Ancestor of a Binary Tree Lowest Common Ancestor of a Binary Search Tree
https://leetcode.com/problems/lowest-common-ancestor-of-deepest-leaves/
(编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |