C++二叉树各种遍历输出（先序，后序，中序，层序）

背景是合并两颗二叉树

相关代码

#include <iostream>

using namespace std;
#define MaxSize 15

//节点信息
struct TreeNode {
    int val;
    TreeNode *left;
    TreeNode *right;

    TreeNode(int x = 0) : val(x), left(NULL), right(NULL) {}
};

//定义队列
struct SqQueue {
    TreeNode data[MaxSize];
    int front, rear;

};
SqQueue Q;


//队列相关操作
//初始化
void InitQueue(SqQueue &Q) {
    Q.rear = Q.front = 0;
}

//判队空
bool isEmpty(SqQueue Q) {
    if (Q.front == Q.rear) return true;
    else return false;
}

//入队
bool EnQueue(SqQueue &Q, TreeNode x) {
    if ((Q.rear + 1) % MaxSize == Q.front) return false;
    Q.data[Q.rear] = x;
    Q.rear = (Q.rear + 1) % MaxSize;
    return true;
}

//出队
bool DeQueue(SqQueue &Q, TreeNode &x) {
    if (Q.rear == Q.front) return false;
    x = Q.data[Q.front];
    Q.front = (Q.front + 1) % MaxSize;
    return true;
}


//访问节点
void Visit(TreeNode *T) {
    cout << T->val << " ";
}

//先序遍历
//void PreOrder(TreeNode *T) {
//    if (T != NULL) {
//        Visit(T);
//        PreOrder(T->left);
//        PreOrder(T->right);
//    }
//}

//中序遍历
//void InOrder(TreeNode *T) {
//    if (T != NULL) {
//        InOrder(T->left);
//        Visit(T);
//        InOrder(T->right);
//    }
//}

//后序遍历
//void PostOrder(TreeNode *T) {
//    if (T != NULL) {
//        PostOrder(T->left);
//        PostOrder(T->right);
//        Visit(T);
//    }
//}

//层序遍历
void LevelOrder(TreeNode *T) {
    InitQueue(Q);
    TreeNode p;
    EnQueue(Q, *T);
    while (!isEmpty(Q)) {
        DeQueue(Q, p);
        Visit(&p);
        if (p.left != NULL)
            EnQueue(Q, *p.left);
        if (p.right != NULL)
            EnQueue(Q, *p.right);
    }

}

//合并算法:
//对应位置如果都存在，把两者相加的和放到t1节点上
//t1存在，t2不存在，什么也不需要操作,直接返回t1指针
//t2存在，t1不存在，什么也不需要操作,直接返回t2指针
//t1左（右）子树存在，t2左（右）子树不存在，把t2子树接到t1的左（右）子树上，结束本次操作
//t2左（右）子树存在，t1左（右）子树不存在，把t1子树接到t2的左（右）子树上，结束本次操作
TreeNode *Merge(TreeNode *t1, TreeNode *t2) {
    if (t1 && t2) {
        t1->val = t1->val + t2->val;

        if (t1->left) {
            Merge(t1->left, t2->left);
        } else {
            t1->left = t2->left;
        }

        if (t1->right) {
            Merge(t1->right, t2->right);
        } else {
            t1->right = t2->right;
        }

    } else {
        if (t2) {
            return t2;
        } else {
            return t1;
        }
    }


    return t1;
}


int main() {


    //建立两棵树
    TreeNode *t1;
    TreeNode t11(1);
    TreeNode t12(3);
    TreeNode t13(2);
    TreeNode t14(5);

    TreeNode *t2;
    TreeNode t21(2);
    TreeNode t22(1);
    TreeNode t23(3);
    TreeNode t24(4);
    TreeNode t25(7);

    t1 = &t11;
    t11.left = &t12;
    t11.right = &t13;
    t12.left = &t14;

    t2 = &t21;
    t21.left = &t22;
    t21.right = &t23;
    t22.right = &t24;
    t23.right = &t25;

    //合并并输出
    LevelOrder(Merge(t1, t2));


    return 0;
}

输出结果