102 Binary Tree Level Order Traversal

1 题目

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 尝试解

class Solution {
public:
    vector<vector<int>> levelOrder(TreeNode* root) {
        queue<TreeNode*> saver;
        vector<vector<int>> result;
        if(root == NULL) return result;
        saver.push(root);
        while(!saver.empty()){
            int count = saver.size();
            vector<int> temp;
            for(int i = 0; i < count; i++){
                TreeNode* todelete = saver.front();
                temp.push_back(todelete->val);
                if(todelete->left != NULL) saver.push(todelete->left);
                if(todelete->right != NULL) saver.push(todelete->right);
                saver.pop();
            }
            result.push_back(temp);           
        }
        return result;
    }
};

3 标准解

vector<vector<int>> ret;

void buildVector(TreeNode *root, int depth)
{
    if(root == NULL) return;
    if(ret.size() == depth)
        ret.push_back(vector<int>());
    
    ret[depth].push_back(root->val);
    buildVector(root->left, depth + 1);
    buildVector(root->right, depth + 1);
}

vector<vector<int> > levelOrder(TreeNode *root) {
    buildVector(root, 0);
    return ret;
}