package com.fishercoder.solutions;

import com.fishercoder.common.classes.TreeNode;

/**
 * 1123. Lowest Common Ancestor of Deepest Leaves
 *
 * 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:
 * 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.
 * */
public class _1123 {
    public static class Solution1 {
        public TreeNode lcaDeepestLeaves(TreeNode root) {
            return null;
        }
    }
}

@@ -82,1074 +82,8 @@
 e;%0A%0A
-/**%0A * 1123. Lowest Common Ancestor of Deepest Leaves%0A *%0A * Given a rooted binary tree, return the lowest common ancestor of its deepest leaves.%0A * Recall that:%0A * The node of a binary tree is a leaf if and only if it has no children%0A * 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.%0A * 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.%0A *%0A * Example 1:%0A * Input: root = %5B1,2,3%5D%0A * Output: %5B1,2,3%5D%0A * Explanation:%0A * The deepest leaves are the nodes with values 2 and 3.%0A * The lowest common ancestor of these leaves is the node with value 1.%0A * The answer returned is a TreeNode object (not an array) with serialization %22%5B1,2,3%5D%22.%0A *%0A * Example 2:%0A * Input: root = %5B1,2,3,4%5D%0A * Output: %5B4%5D%0A *%0A * Example 3:%0A * Input: root = %5B1,2,3,4,5%5D%0A * Output: %5B2,4,5%5D%0A *%0A * Constraints:%0A * The given tree will have between 1 and 1000 nodes.%0A * Each node of the tree will have a distinct value between 1 and 1000.%0A * */%0A
 publ
@@ -134,16 +134,45 @@
 ution1 %7B
+%0A        //TODO: implement it
 %0A       

refactor 1123