#include
#include
#include
typedef struct TNode {
char date;
struct TNode *lchild,*rchild;
}TNode,*BiTree;
typedef struct {
BiTree top;
BiTree *base;
int stacksize;
}Stack;
int createBiTree(BiTree &S){
char ch;
scanf("%c",&ch);
if(ch=='#') S=NULL;
else {
S=(TNode *)malloc(sizeof(TNode));
if(!S)
exit(0);
S->date=ch;
createBiTree(S->lchild);
createBiTree(S->rchild);
}
return 1;
}
int Initstack(Stack &R) {
R.base=(BiTree *)malloc(100*sizeof(TNode));
if(!R.base) exit(0);
R.top=R.base;
R.stacksize=100;
return 1;
}
void push(Stack &R,BiTree e) {
if(!(R.top-R.base)) {
R.base=(BiTree )realloc(R.base,(R.stacksize+10)*sizeof(TNode *));
R.top=R.stacksize+R.base;
R.stacksize+=10;
}
*R.top++=e;
}
void pop(Stack &R,BiTree &e) {
if(R.top-R.base==0) return ;
e=(--R.top);
// return e;
}
void printBiTree(BiTree S) {
Stack R;
BiTree p;
if(!S) return ;
else {
Initstack(R);
p=S;
while(p || (R.top-R.base))
{
while(p) {
// printf("%3c",p->date);
push(R,p);
p=p->lchild;
}//while
if(!(R.top-R.base)) return ;
else
{
pop(R,p);
printf("%3c",p->date);
p=p->rchild;
}
}
// return 1;
}
// free(R);
}
int other(BiTree S)
{
if(!S)
return 0;
else
{
printf("%c",S->date);
other(S->lchild);
other(S->rchild);
}
return 1;
}
int main() {
BiTree S;
createBiTree(S);
printBiTree(S);
return 0;
// free(R);
free(S);
}
先序遍历输出,#代表空