[数据结构与算法]二叉树的遍历C++版

#include <iostream>
using namespace std;

//树结构定义
typedef struct BitNode
{
    char data;
    struct BitNode* leftchild, * rightchild;
}BitNode,*BitTree;

//前序遍历
void preOrderTraerver(BitTree T)
{
    if (T == NULL)
        return;
    std::cout << T->data<<"\t";//root
    preOrderTraerver(T->leftchild);//leftchild
    preOrderTraerver(T->rightchild);//rightchild
}

//中序遍历
void inOrderTraerver(BitTree T)
{
    if (T == NULL)
        return;
    inOrderTraerver(T->leftchild);//leftchild
    std::cout << T->data << "\t";//root
    inOrderTraerver(T->rightchild);//rightchild
}

//后序遍历
void PostOrderTraerver(BitTree T)
{
    if (T == NULL)
        return;
    PostOrderTraerver(T->leftchild);//leftchild
    PostOrderTraerver(T->rightchild);//rightchild
    std::cout << T->data << "\t";//root
}


int main()
{
    BitTree T = (BitTree)new BitTree ;
    BitTree L = (BitTree)new BitTree;
    BitTree R = (BitTree)new BitTree;
    
    L->data = 'B';
    L->leftchild = NULL;
    L->rightchild = NULL;

    R->data = 'C';
    R->leftchild = NULL;
    R->rightchild = NULL;

    T->data = 'A';
    T->leftchild=L;
    T->rightchild = R;

    std::cout << "前序遍历：";
    preOrderTraerver(T);
    std::cout << std::endl;

    std::cout << "中序遍历：";
    inOrderTraerver(T);
    std::cout << std::endl;

    std::cout <<"后序遍历：";
    PostOrderTraerver(T);
    std::cout << std::endl;

    system("pause");
    return 0;
}