二叉树的层序遍历（递归）

输出二叉树的层序遍历序列
如[2,6,8,null,null,10,12]，输出[[2],[6,8],[10,12]]
另：若要逆序输出，即[[10,12],[6,8],[2]]，则只需return前reverse(result.begin(),result.end());
Binary Tree Level Order Traversal
借助二维vector跟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>> result;
        level(result,root,1);
        //reverse(result.begin(),result.end());

        return result;
    }

    void level(vector<vector<int>> &result,TreeNode *root,int num)
    {
        if(root==NULL)
            return;
        if(num>result.size())
            result.push_back(vector<int>());

        result[num-1].push_back(root->val);
        level(result,root->left,num+1);
        level(result,root->right,num+1);
    }
};