366. Find Leaves of Binary Tree
/*
* 366. Find Leaves of Binary Tree
* 2016-7-15 by Mingyang
* 这道题目非常的有意思，一层一层的打印出叶子节点并且移除掉
* 我开始的想法就是dfs，自底向上的方法，我想每一层的增加，list的index也增加
* 到叶子节点时候，list的index就是在最后，所以打印出来的就是反的l
相关文章
- 1. 【leetcode】366.Find Leaves of Binary Tree
- 2. Find Leaves of Binary Tree
- 3. 650. Find Leaves of Binary Tree
- 4. C++： Find height of a Binary Tree
- 5. [Leetcode-Tree]Sum of Left Leaves
- 6. 545. Boundary of Binary Tree
- 7. [LeetCode] 545. Boundary of Binary Tree
- 8. Maximum Depth of Binary Tree
- 9. Diameter of Binary tree
- 10. 404. Sum of Left Leaves
- 更多相关文章...
- • XSLT
- • XSLT
- • 算法总结-深度优先算法
- • 使用阿里云OSS+CDN部署前端页面与加速静态资源
相关标签/搜索
每日一句
-
每一个你不满意的现在，都有一个你没有努力的曾经。
欢迎关注本站公众号,获取更多信息
相关文章
- 1. 【leetcode】366.Find Leaves of Binary Tree
- 2. Find Leaves of Binary Tree
- 3. 650. Find Leaves of Binary Tree
- 4. C++： Find height of a Binary Tree
- 5. [Leetcode-Tree]Sum of Left Leaves
- 6. 545. Boundary of Binary Tree
- 7. [LeetCode] 545. Boundary of Binary Tree
- 8. Maximum Depth of Binary Tree
- 9. Diameter of Binary tree
- 10. 404. Sum of Left Leaves