leetcode102.BinaryTreeLevelOrderTraversal

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

解题思路：本题目二叉树的层次遍历，对于二叉树的操作，我们首先可以想到的就是递归，递归的优点就是简单易懂，缺点是时间复杂度和空间复杂度比较高。对于递归的详细的解释，知乎上有很好地解释https://www.zhihu.com/question/20096035

/**
 * 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:
    void Traverse(TreeNode * root,size_t level,vector<vector<int>>&result)
    {
        if(!root)
          return;
        if(result.size()<level)
        {
            result.push_back(vector<int>());
            
        }
        result[level-1].push_back(root->val);
        Traverse(root->left,level+1,result);
        Traverse(root->right,level+1,result);
    }
    vector<vector<int>> levelOrder(TreeNode* root)
    {
        vector<vector<int>> result;
        Traverse(root,1,result);
        return result;
        
    }
    
};