Description:
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,null,null,15,7],
3
/ \
9 20
/ \
15 7
return its level order traversal as:
[[3], [9,20], [15,7]]
分析:给定一个二叉树, 将他的值按照层次的顺序传递出来,从左到右,从上到下。思路也很清晰,我们按照Pre Order Traversal遍历树的时候,附加一个depth变量记录node所在的深度,将node对应的值追加到对应的数组里。
代码如下:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/</font>
class Solution {
public:
vector<vector<int>> levelOrder(TreeNode* root) {
vector<vector<int>> ret;
dfsLevelOrder(root, ret, 1);
return ret;
}
void dfsLevelOrder(TreeNode* root, vector<vector<int>>& ret, int depth)
{
if(root == nullptr)
return;
if(ret.size() < depth)
ret.push_back(vector<int>());
ret[depth - 1].push_back(root->val);
dfsLevelOrder(root->left, ret, depth + 1);
dfsLevelOrder(root->right, ret, depth + 1);
}
};