give root binary tree depth node short distance rootReturn small subtree contain deep node original treeA node call deep large depth possible node entire treethe subtree node tree consist node plus set descendant node Example 1input root 3516208nullnull74output 274explanation we return node value 2 colored yellow diagramThe node colour blue deep node treenotice nod 5 3 2 contain deep node tree node 2 small subtree return itexample 2input root 1output 1explanation the root deep node treeExample 3input root 013null2output 2explanation the deep node tree 2 valid subtree subtree nod 2 1 0 subtree node 2 small ConstraintsThe number nod tree range 1 5000 Nodeval 500The value nod tree unique Note this question 1123 httpsleetcodecomproblemslowestcommonancestorofdeepestleave