本文共 915 字,大约阅读时间需要 3 分钟。
#include#include struct Node{ Node *lchild; Node *rchild; int c;}Tree[110];int loc;Node *creat(){ Tree[loc].lchild=Tree[loc].rchild=NULL; return &Tree[loc++];}//后序遍历 void postOrder(Node *T){ if(T->lchild!=NULL){ postOrder(T->lchild); } if(T->rchild!=NULL){ postOrder(T->rchild); } printf("%d ",T->c);}//中序遍历 void inOrder(Node *T){ if(T->lchild!=NULL){ inOrder(T->lchild); } printf("%d ",T->c); if(T->rchild!=NULL){ inOrder(T->rchild); } printf("%d ",T->c);}//前序遍历void preOrder(Node *T){ printf("%d",T->c); if(T->lchild!=NULL){ preOrder(T->lchild); } if(T->rchild!=NULL){ preOrder(T->rchild); } printf("%d ",T->c);} Node *Insert(Node *T,int x){ if(T==NULL){ T=creat(); T->c=x; return T; } else if(x c) T->lchild=Insert(T->lchild,x); else if(x>T->c) T->rchild=Insert(T->rchild,x); return T;}int main(){ int n; while(scanf("%d",&n)!=EOF){ loc=0; Node *T=NULL; for(int i=0;i
转载地址:http://cnssi.baihongyu.com/