give root binary tree return low common ancestor deep leavesRecall thatthe node binary tree leaf childrenthe depth root tree 0 depth node d depth child d 1the low common ancestor set S node node a large depth node S subtree root A Example 1input root 3516208nullnull74output 274explanation we return node value 2 colored yellow diagramThe node colour blue deep leafnode treenote node 6 0 8 leaf node depth 2 depth node 7 4 3example 2input root 1output 1explanation the root deep node tree lca itselfexample 3input root 013null2output 2explanation the deep leaf node tree 2 lca node ConstraintsThe number nod tree range 1 10000 Nodeval 1000The value nod tree unique Note this question 865 httpsleetcodecomproblemssmallestsubtreewithallthedeepestnode