LeetCode_102二叉树分层打印

102. Binary Tree Level Order Traversal

Medium

169244FavoriteShare

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:
    vector<vector<int>> levelOrder(TreeNode* root) {
        vector<vector<int>> res;
        if(root==nullptr)
            return res;
        TreeNode* p;
        queue<TreeNode*> mq;
        mq.push(root);
        while(!mq.empty())
        {
            queue<TreeNode*> temq;
            vector<int> temRes;
            while(!mq.empty())
            {
                p=mq.front();
                mq.pop();   //记得弹出
                if(p->left)
                    temq.push(p->left);
                if(p->right)
                    temq.push(p->right);
                temRes.push_back(p->val);
            }
            res.push_back(temRes);
            mq=temq;
        }
        return res;
    }
};