2019年4月13日
[LeetCode] 865. Smallest Subtree with all the Deepest Nodes 包含最深结点的最小子树
摘要： Given a binary tree rooted at , the depth of each node is the shortest distance to the root. A node is deepest if it has the largest depth possible am 阅读全文
posted @ 2019-04-13 23:53 Grandyang 阅读(2964) 评论(0) 推荐(0) 编辑
Fork me on GitHub