32_PrintTreeFromTopToBottom 从上到下打印二叉树

从上到下打印出二叉树的每个节点，同一层的节点按照从左到右的顺序打印。

例如:
给定二叉树: [3,9,20,null,null,15,7],

    3
   / \
  9  20
    /  \
   15   7
返回：

[3,9,20,15,7]

来源：力扣（LeetCode）
链接：https://leetcode.cn/problems/cong-shang-dao-xia-da-yin-er-cha-shu-lcof
 

此题为BFS 广度优先搜索，需要借助队列来完成，依次对每一层进行入队列和出队列操作（先入队列，出队列的时候依次对每一个节点的子节点进行判断是否为空，非空的情况下入队列，依次循环）

/**
 * 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<int> levelOrder(TreeNode* root) {
        vector<int> res;
        queue<TreeNode*> que;
        if (root != NULL) {
            que.push(root);
        }
        while (!que.empty()) {
            size_t num = que.size();
            for (int i = 0; i < num; ++i) {
                TreeNode* node = que.front();
                res.push_back(node->val);
                que.pop();
                if (node->left != NULL)
                    que.push(node->left);
                if (node->right != NULL) {
                    que.push(node->right);
                }
            }
        }
        return res;
    }
};

若要求

从上到下按层打印二叉树，同一层的节点按从左到右的顺序打印，每一层打印到一行。

/**
 * 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;
        queue<TreeNode*> que;
        if (root != NULL) {
            que.push(root);
        }
        while (!que.empty()) {
            vector<int> layer;
            size_t num = que.size();
            for (int i = 0; i < num; ++i) {
                TreeNode* node = que.front();
                layer.push_back(node->val);
                que.pop();
                if (node->left != NULL)
                    que.push(node->left);
                if (node->right != NULL) {
                    que.push(node->right);
                }
            }
            res.push_back(layer);
        }
        return res;
    }
};

若要求

请实现一个函数按照之字形顺序打印二叉树，即第一行按照从左到右的顺序打印，第二层按照从右到左的顺序打印，第三行再按照从左到右的顺序打印，其他行以此类推。

/**
 * 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;
        queue<TreeNode*> que;
        if (root != NULL) {
            que.push(root);
        }
        size_t layernum = 0;
        while (!que.empty()) {
            vector<int> layer;
            size_t num = que.size();
            for (int i = 0; i < num; ++i) {
                TreeNode* node = que.front();
                layer.push_back(node->val);
                que.pop();
                if (node->left != NULL)
                    que.push(node->left);
                if (node->right != NULL) {
                    que.push(node->right);
                }
            }
            if (layernum & 1)
                reverse(layer.begin(),layer.end());
            ++layernum;
            res.push_back(layer);
        }
        return res;
    }
};