cheet 4 二叉树

二叉树

typedef struct BiTNode
{
    int data;
    struct BiTNode *lchild, *rchild;
}BiTNode, * BiTree;

void PreOrder(BiTree b)
{
    if(b != NULL)
    {
        Visit(b->data);
        PreOrder(b->lchild);
        PreOrder(b->rchild);
    }
}

void InOrder(BiTree b)
{}

void PostOrder(BiTree b)
{}

void CreateBiTree(BiTree &b)
{
    char ch;
    cin >> ch;

    if (ch == '0')
        b = NULL;
    else
    {
        b = (BiTNode *)malloc(sizeof(BiTNode));
        b->data = ch;
        CreateBiTree(b->lchild);
        CreateBiTree(b->rchild);
    }
}