leetcode-102-Binary Tree Level Order Traversal

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

将每一层节点的val值，分别保存起来。

就是利用队列，层次遍历二叉树，并用一个num记录每一层的节点数。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<vector<int>> levelOrder(TreeNode* root) {
        vector<vector<int> > a;
        vector<int>b;
        if (!root) return a;// 为空则直接返回空的a
        
        //  根节点不为空,先把根节点的val加入到a中
        b.push_back(root->val);
        a.push_back(b);
        b.clear();
        
        queue<TreeNode*>q;
        q.push(root);
        int num = 1;//每一层的节点数
        while (!q.empty()) {
            TreeNode* t = q.front();
            q.pop();
            num --;
            
            if (t->left) {
                b.push_back(t->left->val);
                q.push(t->left);
            }
            if (t->right) {
                b.push_back(t->right->val);
                q.push(t->right);
            }
            
            //if (num == 0) 
            if (num == 0) { // 一层访问完了 将这一层的所有val加入到a，并将num赋值为下一层的节点数
                num = q.size();
                if(!b.empty())
                    a.push_back(b);
                b.clear();
            }
        }
        //a.pop_back();
        return a;
    }
};

递归

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution { //此方法主要解决 执行a[dep].push_back(root->val);时， a还没有dep个元素
public:
    vector<vector<int> >a;
    void solve(TreeNode* root,int dep) {
        if (!root) return ;
        if (a.size() > dep) { // a[dep]存在 则直接加入
            a[dep].push_back(root->val);
        }
        else {  // 否则创建一个vector
            vector<int>b;
            b.push_back(root->val);
            a.push_back(b);
        }
        solve(root->left,dep + 1);
        solve(root->right,dep + 1);
    }
    vector<vector<int>> levelOrder(TreeNode* root) {
        a.clear();
        solve(root,0);
        return a;
    }
};

一样的递归，方法略有不同

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution { //此方法主要解决 执行a[dep].push_back(root->val);时， a还没有dep个元素
public:
    vector<vector<int> >a;
    void solve(TreeNode* root,int dep) {
        if (!root) return ;
        if (a.size() <= dep) {// 加入一个空的vector<int>
            vector<int>b;
            a.push_back(b);
        }
        a[dep].push_back(root->val);
        solve(root->left,dep + 1);
        solve(root->right,dep + 1);
    }
    vector<vector<int>> levelOrder(TreeNode* root) {
        a.clear();
        solve(root,0);
        return a;
    }
};