从上往下打印二叉树

题目

从上往下打印出二叉树的每个节点，同层节点从左至右打印。

思路

广度优先搜索。借助一个队列，检查队列首元素，如果有左孩子则push leftChild,如果有右孩子则push rightChild, 然后打印首元素，并且pop()首元素。当队列里没有元素了，则说明已经打印了所有结点。

示例

如果一棵由：
前序：{1,2,4,5,3,7}
中序：{1,2,4,5,3,7}
确定的树。
输出：1 2 3 4 5 7

代码

#include <iostream>
#include <queue>
#include <vector>

using namespace std;

struct TreeNode {
    int val;
    TreeNode* left;
    TreeNode* right;
    TreeNode(int x):
    val(x),left(nullptr),right(nullptr){

    }
};

class Solution{
public:
    vector<int> PrintFromTopToBottom(TreeNode* root) {
        vector<int> result;
        if (root == nullptr)
            return result;
        queue<TreeNode *> auxiliary_que;
        auxiliary_que.push(root);
        result.push_back(root->val);
        while (!auxiliary_que.empty()) {
            if (auxiliary_que.front()->left != nullptr)
                auxiliary_que.push(auxiliary_que.front()->left);
            if (auxiliary_que.front()->right != nullptr)
                auxiliary_que.push(auxiliary_que.front()->right);
            cout << auxiliary_que.front()->val << " ";
            result.push_back(auxiliary_que.front()->val);
            auxiliary_que.pop();
        }
        return result;
    }

    // 根据前序和中序 获取一棵树，用来测试
    TreeNode* CreateTree(vector<int> pre, vector<int> mid){
        TreeNode* root(nullptr);
        root = CreateTree(pre, 0, pre.size()-1, mid, 0, mid.size()-1);
        return root;
    }

private:
    TreeNode* CreateTree(vector<int> pre,int pre_start, int pre_end, vector<int> mid, int mid_start, int mid_end){
        if (pre_start > pre_end || mid_start > mid_end)
            return nullptr;
        TreeNode* node = new TreeNode(0);
        for (int i = mid_start; i < mid_end+1 ; ++i) {
            if (mid[i] == pre[pre_start]){
                node->val = mid[i];
                node->left = CreateTree(pre, pre_start+1, i-mid_start+pre_start, mid, mid_start, i-1);
                node->right = CreateTree(pre, i-mid_start+pre_start+1, pre_end, mid, i+1, mid_end);
                break;
            }
        }
        return node;
    }
};

int main(){
    Solution re;
    vector<int> pre = {1,2,4,5,3,7};
    vector<int> mid = {4,2,5,1,3,7};
    TreeNode* tree = re.CreateTree(pre,mid);
    re.PrintFromTopToBottom(tree);
    return 0;
}