标签:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
private:
vector<vector<int>> ret;
public:
void traversal(int dep, TreeNode *root) {
if(root == NULL)
return;
if(ret.size() > dep)
ret[dep].push_back(root->val);
else {
vector<int> tmp;
tmp.push_back(root->val);
ret.push_back(tmp);
}
traversal(dep + 1,root->left);
traversal(dep + 1,root->right);
}
vector<vector<int>> levelOrder(TreeNode* root) {
traversal(0, root);
return ret;
}
};
版权声明:本文为博主原创文章,未经博主允许不得转载。
Binary Tree Level Order Traversal
标签:
原文地址:http://blog.csdn.net/guanzhongshan/article/details/46738131