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

输出二叉树的层序遍历序列
如[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

/**
 * 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;
        if(root==NULL)
            return result;

        vector<int> level;
        queue<const TreeNode*> cur,next;
        const TreeNode *node=root;
        cur.push(node);

        while(!cur.empty())
        {
            while(!cur.empty())
            {
                node=cur.front();
                cur.pop();
                level.push_back(node->val);
                if(node->left)
                    next.push(node->left);
                if(node->right)
                    next.push(node->right);
            }
            result.push_back(level);
            level.clear();
            swap(cur,next);
        }
        //reverse(result.begin(),result.end());

        return result;
    }
};