0
点赞
收藏
分享

微信扫一扫

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]
]


分析:

二叉树的层序遍历,把每一层的存到一个vector中,比较简单,直接上代码。

(假定第一层的depth为0)


/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution
{
private:
void visit(TreeNode *node, int depth, vector<vector<int>> &result)
{
if (node == NULL)
{
return;
}

if (result.size() > depth)
{
result[depth].push_back(node->val);
}
else
{
vector<int> level;
level.push_back(node->val);
result.push_back(level);
}

visit(node->left, depth + 1, result);
visit(node->right, depth + 1, result);
}
public:
vector<vector<int>> levelOrder(TreeNode *root)
{
vector<vector<int>> result;
visit(root, 0, result);
return result;
}
};



举报

相关推荐

0 条评论