Given a binary tree rooted at root, the depth of each node is the shortest distance to the root.
阅读背景：
[LeetCode] Smallest Subtree with all the Deepest Nodes 包含最深结点的最小子树
来源：互联网
分享到：
