数据结构---先序遍历

typedef struct node
{
ElemType data;
struct node *lchild;
struct node *rchild;
}BTNode;

void preOrder(BTNode *b)
{
if(b != NULL)
{
printf(“%c”,b->data);
preOrder(b->lchild);
preOrder(b->rchild);
}
}

void f(BTNode *b)
{
if(b != NULL)
{
if(b->lchild == NULL &&　b->rchild == NULL)
{
printf(” %c “,b->data);
}
f(b->lchild);
f(b->rchild);
}
}

void preOrder1(BTNode *b)
{
BTNode *ST[MaxSize],*p;
int top = -1;
if(b != NULL)
{
top++;
ST[top] = b;
while(top > -1)
{
p=ST[top];
top–;
printf(“%c”,p->data);
if(p->rchild != NULL)
{
top++;
ST[top] = p->rchild;
}
if(p->lchild != NULL)
{
top++;
ST[top] = p->lchild;
}
}
printf(“\n”);
}
}