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