Given a rooted binary tree, return the lowest common ancestor of its deepest leaves.
d, the depth of each of its children?is?
Sof nodes is the node?
A?with the largest depth such that every node in S is in the subtree with root?
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]".
Input: root = [1,2,3,4] Output: 
Input: root = [1,2,3,4,5] Output: [2,4,5]