首页 > 代码库 > 【leetcode】Binary Tree Level Order Traversal
【leetcode】Binary Tree Level Order Traversal
每日一练，
Given a binary tree, return the level order traversal of its nodes‘ values. (ie, from left to right, level by level).
For example:
Given binary tree {3,9,20,#,#,15,7},
3 / 9 20 / 15 7
return its level order traversal as:
[ [3], [9,20], [15,7] ]
代码如下：
class Solution {
public:
int level(TreeNode *node)
{
if (node == NULL) return 0;
if (node->left == NULL && node->right == NULL) return 1;
return max(level(node->left),level(node->right)) + 1;
}
void levelPush(TreeNode *node, int height, vector<int> &vec, int cur_height){
if (height == cur_height) vec.push_back(node->val);
if (node->left != NULL) levelPush(node->left, height, vec, cur_height + 1);
if (node->right != NULL) levelPush(node->right, height, vec, cur_height + 1);
}
vector<vector<int> > levelOrder(TreeNode *root) {
int height = level(root);
vector<vector<int> > vvec;
for(int i = 1;i <= height;i++)
{
vector<int> vec;
levelPush(root, i, vec, 1);
vvec.push_back(vec);
}
return vvec;
}
};
【leetcode】Binary Tree Level Order Traversal
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。