865. Smallest Subtree with all the Deepest Nodes

題目描述 Given a binary tree rooted at root, the depth of each node is the shortest distance to the root. A node is deepest if it has the largest depth possible among any node in the entire tree. The subt

>>阅读原文<<