2016年6月25日
[LeetCode] 366. Find Leaves of Binary Tree 找二叉树的叶节点
摘要： Given a binary tree, collect a tree's nodes as if you were doing this: Collect and remove all leaves, repeat until the tree is empty. Example: Input: 阅读全文
posted @ 2016-06-25 12:34 Grandyang 阅读(16437) 评论(2) 推荐(0)
Fork me on GitHub