/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
void levelHelper(TreeNode *node, int level, map<int,vector<int>> &levelTree) {
if(node==NULL) return;
levelHelper(node->left,level+1,levelTree);
levelHelper(node->right,level+1,levelTree);
levelTree[level].push_back(node->val);
}
vector<vector<int> > levelOrder(TreeNode *root) {
map<int,vector<int>> levelTree;
levelHelper(root,0,levelTree);
vector<vector<int>> result;
for(map<int,vector<int>>::iterator i=levelTree.begin();i!=levelTree.end();i++)
result.push_back(i->second);
return result;
}
};
[LeetCode] Binary Tree Level Order Traversal
最新推荐文章于 2024-07-14 11:23:58 发布