102. 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,null,null,15,7],

    3
   / \
  9  20
    /  \
   15   7

return its level order traversal as:

[
  [3],
  [9,20],
  [15,7]
]

代码：

/**
 * 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:
    //use queue:
    vector<vector<int>> levelOrder(TreeNode* root) {
        vector<vector<int>> ans;
        queue<TreeNode*> q;
        if(root == NULL) return ans;
        q.push(root);
        while(!q.empty() ){
            vector<int> temp;
            int n = q.size();
            for(int i = 0; i < n; i++)
            {
                TreeNode* cur = q.front();
                temp.push_back(cur->val);
                q.pop();
                if(cur->left) q.push(cur->left);
                if(cur->right) q.push(cur->right);
            }
            ans.push_back(temp);
            
        }
        return ans;
    }*/
    //use recursion:
    vector<vector<int>> ans;
    vector<vector<int>> levelOrder(TreeNode* root) {
        help(root, 1);
        return ans;
    }
    void help(TreeNode* root, int depth){
        if(root == NULL) return ;
        if(ans.size() < depth) ans.push_back(vector<int>());
        ans[depth -1].push_back(root->val);
        //help(root->right, depth + 1);
        help(root->left, depth + 1);
        help(root->right, depth + 1);
    }
    
};