|
2 | 2 |
|
3 | 3 | importcom.fishercoder.common.classes.TreeNode; |
4 | 4 |
|
5 | | -/** |
6 | | - * 1123. Lowest Common Ancestor of Deepest Leaves |
7 | | - * |
8 | | - * Given a rooted binary tree, return the lowest common ancestor of its deepest leaves. |
9 | | - * Recall that: |
10 | | - * The node of a binary tree is a leaf if and only if it has no children |
11 | | - * 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. |
12 | | - * 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. |
13 | | - * |
14 | | - * Example 1: |
15 | | - * Input: root = [1,2,3] |
16 | | - * Output: [1,2,3] |
17 | | - * Explanation: |
18 | | - * The deepest leaves are the nodes with values 2 and 3. |
19 | | - * The lowest common ancestor of these leaves is the node with value 1. |
20 | | - * The answer returned is a TreeNode object (not an array) with serialization "[1,2,3]". |
21 | | - * |
22 | | - * Example 2: |
23 | | - * Input: root = [1,2,3,4] |
24 | | - * Output: [4] |
25 | | - * |
26 | | - * Example 3: |
27 | | - * Input: root = [1,2,3,4,5] |
28 | | - * Output: [2,4,5] |
29 | | - * |
30 | | - * Constraints: |
31 | | - * The given tree will have between 1 and 1000 nodes. |
32 | | - * Each node of the tree will have a distinct value between 1 and 1000. |
33 | | - * */ |
34 | 5 | publicclass_1123 { |
35 | 6 | publicstaticclassSolution1 { |
| 7 | +//TODO: implement it |
36 | 8 | publicTreeNodelcaDeepestLeaves(TreeNoderoot) { |
37 | 9 | returnnull; |
38 | 10 | } |
|