Leetcode | 0102.求二叉树的层序遍历

简单模板：

void FloorPrint_QUEUE(pTreeNode &Tree) //层序遍历_队列实现
{
    queue < pTreeNode> q;
    if (Tree != NULL)
    {
        q.push(Tree);   //根节点进队列
    }

    while (q.empty() == false)  //队列不为空判断
    {
        cout << q.front()->data << " → "; 

        if (q.front()->leftPtr != NULL)   //如果有左孩子，leftChild入队列
        {
            q.push(q.front()->leftPtr);   
        }

        if (q.front()->rightPtr != NULL)   //如果有右孩子，rightChild入队列
        {
            q.push(q.front()->rightPtr);
        }
        q.pop();  //已经遍历过的节点出队列
    }
}

分层存储：

class Solution {
public:
  
    vector<vector<int> > levelOrder(TreeNode* root) {
        // write code here
        vector<vector<int> > res;
        if (root==nullptr)
            return res;
        queue<TreeNode*> data;
        TreeNode*node = nullptr;
        vector<int>cur;
        data.push(root);
        while(!data.empty()){
            cur.clear(); //开始遍历一个新的层
            int n = data.size();
            for(int i = 0;i < n;i++){
                node = data.front();
                data.pop();
                cur.push_back(node->val);
                if (node->left!=nullptr)
                    data.push(node->left);
                if (node->right!=nullptr)
                    data.push(node->right);
            }
            res.push_back(cur);
        }
        return res;
    }
};