LeetCode #865 Smallest Subtree with all the Deepest Nodes 具有所有最深节点的最小子树
865SmallestSubtreewithalltheDeepestNodes具有所有最深节点的最小子树Description:Giventherootofabinarytree,thedepthofeachnodeistheshortestdistancetotheroot.Returnthesmallestsubtreesuchthatitcontainsallthedeepestnodes