366. Find Leaves of Binary Tree
Posted 日常任务
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了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:
Given binary tree
1 / 2 3 / \ 4 5
Returns [4, 5, 3], [2], [1]
.
Explanation:
1. Removing the leaves [4, 5, 3]
would result in this tree:
1 / 2
2. Now removing the leaf [2]
would result in this tree:
1
3. Now removing the leaf [1]
would result in the empty tree:
[]
Returns [4, 5, 3], [2], [1]
.
vector<vector<int>> findLeaves(TreeNode* root) { vector<vector<int>> ret; removeLeaves(ret, root); return ret; } int removeLeaves(vector<vector<int>> & ret, TreeNode* root) { if (root == NULL) return 0; int d1 = removeLeaves(ret, root->left); int d2 = removeLeaves(ret, root->right); int lev = max(d1, d2) + 1; if (ret.size() <= lev) ret.resize(lev); ret[lev - 1].push_back(root->val); return lev; }
以上是关于366. Find Leaves of Binary Tree的主要内容,如果未能解决你的问题,请参考以下文章
366. Find Leaves of Binary Tree
Leetcode 366. Find Leaves of Binary Tree
Leetcode 366: Find Leaves of Binary Tree
366. Find Leaves of Binary Tree C#