问题描述:
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] ]分析:根据树的性质,每层有2^(i-1)个节点,i表示当前层,因此,从根节点开始依次遍历他的每个节点,在判断是否有子节点,若有则添加到下一行数组中。
代码:
class Solution {
public:
vector<vector<int>> ret;
void buildVector(TreeNode *node, int depth){
if(node == NULL) return;//当某一节点为空时,不添加元素
if(ret.size() == depth)//判断该节点是否属于当前层
ret.push_back(vector<int>());//开辟新层的空间
ret[depth].push_back(node->val);//将该节点的值加入数组
buildVector(node->left, depth + 1);//判断左子树
buildVector(node->right, depth + 1);//判断右子树
}
vector<vector<int> > levelOrder(TreeNode *root) {
buildVector(root, 0);
return ret;
}
};