#include <stdlib.h>

typedef struct bitnode{

    char data;

    struct bitnode *lchild, *rchild;

}bitnode, *bitree;

void createbitree(bitnode **t, int *n){

    char x;

    bitnode *q;

    *n=*n+1;

    printf("\n Input  %d  DATA:",*n);

    x=getchar();

    if(x!='\n') getchar();

    if (x=='\n')

    return;

    q=(bitnode*)malloc(sizeof(bitnode));

    q->data=x;

    q->lchild=NULL;

    q->rchild=NULL;

    *t=q;

    printf(" This Address is:   %o,    Data is:  %c,\n      Left Pointer is:   %o,       Right Pointer is:  %o",q,q->data,q->lchild,q->rchild);

    createbitree(&q->lchild,n);

    createbitree(&q->rchild,n);

    return;

}

void visit(bitnode *e)

{

printf("  Address:  %o,  Data:  %c,  Left Pointer:  %o,  Right Pointer:  %o\n",e,e->data,e->lchild,e->rchild);

}

void preordertraverse(bitnode *t){

    if(t){

        visit(t);

        preordertraverse(t->lchild);

        preordertraverse(t->rchild);

        return;

    }

    else

        return;

}

void inordertraverse(bitnode *t){

    if(t){

        inordertraverse(t->lchild);

        visit(t);

        inordertraverse(t->rchild);

        return;

    }

    else

        return;

}

void postordertraverse(bitnode *t){

    if(t){

        postordertraverse(t->lchild);

        postordertraverse(t->rchild);

        visit(t);

    }

}

main()

{

bitnode *t; int count=0;

int n=0;

printf("\n  Please input TREE Data:\n");

createbitree(&t,&n);

preordertraverse(t);

inordertraverse(t);

postordertraverse(t);

}

#include <stdlib.h>

typedef struct bitnode{

    char data;

    struct bitnode *lchild, *rchild;

}bitnode, *bitree;

void createbitree(bitnode **t, int *n){

    char x;

    bitnode *q;

    *n=*n+1;

    printf("\n Input  %d  DATA:",*n);

    x=getchar();

    if(x!='\n') getchar();
   //后面的getchar函数是用来消除每次输入完字符后按的空格键（\n）

    if (x=='\n')

    return;

    q=(bitnode*)malloc(sizeof(bitnode));

    q->data=x;

    q->lchild=NULL;

    q->rchild=NULL;

    *t=q;

    printf(" This Address is:   %o,    Data is:  %c,\n      Left Pointer is:   %o,       Right Pointer is:  %o",q,q->data,q->lchild,q->rchild);

    createbitree(&q->lchild,n);

    createbitree(&q->rchild,n);

    return;

}

main()

{

bitnode *t; int count=0;

int n=0;

printf("\n  Please input TREE Data:\n");

createbitree(&t,&n);

}

注意二叉树的建立必须在所有的叶子节点上lchild和rchild都输入\n才能完成整个二叉树的建立！

1 、以下代码不能达到预期的效果：

typedef int ElemType;

typedef struct ListNode {

    ElemType data;

    struct LNode *next;

}LNode;

int BadInsert(LNode *head)

{

    LNode *NewL;

    NewL = (LNode *)malloc(sizeof(LNode));

    if(!NewL){

        printf("Malloc ERROR\n");

        return ERROR;

    }

    NewL->next = head;

    /*Incorrectly updates local copy of head.

    *Calling code retains the old values for the first element

    *pointer, so it now points at the second element of the list

    */

    /* 下面的代码只是修改了head的一个副本，并没有修改实际传进来的

    * 参数head，从而并没有达到预期的效果

    */

    head = NewL;

    return 1;

}

2. 正确的代码

int Insert(LNode **head)

{

    LNode *NewL;

    NewL = (LNode *)malloc(sizeof(LNode));

    if(!NewL)

        return 0;

    NewL->next = *head;

    /* *head gives the calling function's head pointer, so

    *the change is not lost when this function returns

    */

    *head = NewL;

    return 1;

}

//ListInsert_Dul.cpp

//This program is to insert a node into the DuLinkList

# include <stdlib.h>

# include <malloc.h>

# include <iostream.h>

# include <conio.h>

# define INIT_LENGTH 10

# define OK 1

# define ERROR 0

typedef int ElemType;

typedef struct DuLNode      //define DuLinkList structure

{   int data;

    struct DuLNode *prior;

    struct DuLNode *next;

}DuLNode,*DuLinkList;

int DuLinkLength(DuLNode *L){

    DuLNode *p;

    int i = 0;

    p = L;

    if(!L)

       return 0;

    else {

       while(p){

           i++;

           p = p->next;

       }

    }

    return i;

}

DuLNode *GetElemP_DuL(DuLNode *L, int i){

    int j;

    int k = 1;

    DuLNode *p;

    p = L;

    j = DuLinkLength(L);

    /*i=i±íʾ²åÔÚË«Á´±íµÄµÚÒ»¸öÔªËØλÖã¬j+1±íʾ

    *²åÔÚ×îºóÒ»¸öÔªËØÖ®ºó

    */

    if(i<2||i>j+1){

       return NULL;

    }

    else {

       while(k < i-1){

           k++;

           p = p->next;

       }

       return p;

    }

}

int ListInsert_DuL(DuLNode *L, int i, ElemType e){

    DuLNode *p, *s;

    if(!(p = GetElemP_DuL(L,i)))

       return ERROR;

    if(!(s = (DuLNode *)malloc(sizeof(DuLNode))))

       return ERROR;

    s->data = e;

    s->prior = p;

    s->next = p->next;

    p->next = s;

    return OK;

}

void main()               //main() function

{    int i,j,e;

     //DuLNode node[10];

     DuLNode *L,*p;

     int array[10]={5,8,12,18,25,30,37,46,51,89};

     L=(DuLNode *)malloc(sizeof(DuLNode));

     L->next=NULL;

     L->data = array[0];

     L->prior=NULL;

     for (i=1;i<=9;i++)

     { 

     p=(DuLNode *)malloc(sizeof(DuLNode));

     p->data=array[i];

     L->next = p;

     p->prior = L;

     p->next = NULL;

     L = L->next;

     /*

     p->next=L->next;

     p->next->prior=p;

     L->next=p;

     */

     }

     for(i=1;i<=9;i++)

        L=L->prior;

     p = L;

     cout<<endl<<endl<<"ListInsert_Dul.cpp";

     cout<<endl<<"==================";

     cout <<endl<<endl<<"The old DuLNode is : ";  //output the old DuLinkList

     for(j=0;j<10;j++)

     {  

     cout<<p->data<<" ";

     p=p->next;

     }

     cout<<endl<<endl<<"Please input the location to insert (1--11) : ";

     cin>>i;

     cout<<"Please input the integer to insert (eg,58)  : ";

     cin>>e;

     if(ListInsert_DuL(L,i,e))

     {  cout <<endl<<"The new DuLNode is : ";

    p=L;

    for(i=0;i<INIT_LENGTH;i++)

    {  

        cout<<p->data<<" ";

       p=p->next;

    }

     }

     cout<<endl<<endl<<"...OK!...";

     getch();

} //main() end

    LNode *pa, *pb, *pc;

    pa = La->next;

    pb = Lb->next;

    pc = Lc = La;

    while(pa && pb){

        if(pa->data <= pb->data){ // 小的先挂到Lc上去

            pc->next = pa;

            pc = pc->next;

            pa = pa->next;

        }  

        else{

            pc->next = pb;

            pc->next = pc;

            pb = pb->next;

        }

    }  

    pc->next = pa? pa:pb; // 将剩余的所有节点直接挂到Lc上去

    free(Lb);

}

    ElemType *pa,*pb,*pc;

    int pa_length,pb_length,pc_length;

    pa_length = La.length;

    pb_length = Lb.length;

    Lc.listsize = pa_length + pb_length;

    pc = (ElemType *)malloc(listsize * sizeof(ElemType));

    if(!pc){

        printf("malloc was failed\n");

        return;

    }

    Lc.elem = pc;

    pa = La.elem;

    pb = Lb.elem;

    while(pa<=&La.elem[La.length-1]&&pb<=&Lb.elem[Lb.length-1]){

        if(*pa<=*pb)

            *pc++=*pa++;

        else

            *pc++=*pb++;

    }

    while(pa<=&La.elem[La.length-1])

        *pc++=*pa++;

    while(pb<=&Lb.elem[Lb.length-1])

        *pc++=*pb++

}//MergList_Sq

//Delete the NO.i Element of Sq_List and get the value

#include <stdlib.h>

#include <iostream.h>

#include <conio.h>

#include <stdio.h>

#define ElemType int

#define LIST_INIT_SIZE 100

#define LISTINCREMENT 10

typedef struct

{   int *elem;

    int length;

    int listsize;

}SqList;

int InitList_Sq(SqList &L)                                    //InitList_Sq() function

{   //Inititial a Sq_List

    L.elem=(int *)malloc(LIST_INIT_SIZE *sizeof(int));

    if (!L.elem) return(0);

    L.length=0;

    L.listsize=LIST_INIT_SIZE;

    return(1);

}//end of InitList_Sq() function

int ListDelete_Sq(SqList &L, int i){

    ElemType *p,*q;

    if( i<1 || i>L.length){

       printf("The Entry you want to Delete is not exsit\n");

       return 0;

    }

    //e=L.elem[i-1];          // 提取要删除项的内容

    q=&L.elem[L.length-1];   // 最后一项的地址

    for(p=&L.elem[i];p<=q;++p)  // 从要删除项的后一项开始每项都往前放一个位置

       *(p-1)=*p;

    --L.length;

    return 1;

}

// 输入的是 Sqlist 中的一个表项 , 所以应该先查找再删除 , 如果找到就删除 , 没有找到返回

int LocateElem_Sq(SqList L, ElemType e){

    int i;

    for(i=0; i<=L.length-1;i++){

       if(L.elem[i] == e)

           return i+1; //e 的位置为第 i+1 的位置

    }

    return 0; // 没有找到

}

void ListDelete_Sq_bye(SqList &L, ElemType e){

    int i;

    i=LocateElem_Sq(L,e);

    if(i != 0){

       printf("\n%d is one of the SqList Entry\n",e);

       ListDelete_Sq(L,i);

    }

    else

       printf("Can't found the %d\n",e);

}

void main()                                             //main() function

{

   SqList L;

   int i,j;

   //L.elem=array;

   //L.length=LIST_INIT_LENGTH;

   cout<<"ListDelete_Sq.cpp"<<endl<<"================="<<endl<<endl;

   InitList_Sq(L);

   cout<<"Please input the Length of Demo SqList L: <eg. 5> ";

   cin>>L.length;

   cout<<"Please input the data of Demo SqList L: <eg. {34,54,30,2,40,...}> "<<endl;

   for(j=0;j<L.length;j++)

     cin>>L.elem[j];

   cout<<endl;

   cout<<"Success to create a SqList:"<<endl;

   cout<<"Please input the  element of Sq_List to delete:  <eg. 3> ";

   cin>>i;

   ListDelete_Sq_bye(L,i);

   printf("---the data you delete is----------%d \n",i);

   cout<<"The SqList After Delete is:  ";

   for(j=0;j<L.length;j++)

      cout<<L.elem[j]<<"  ";

   cout<<endl<<"...OK...!"<<endl;

   getch();

}//end of main() function

//ListDelete_Sq.cpp

//Delete the NO.i Element of Sq_List and get the value

#include <stdlib.h>

#include <iostream.h>

#include <conio.h>

#include <stdio.h>

#define ElemType int

#define LIST_INIT_SIZE 100

#define LISTINCREMENT 10

typedef struct

{   int *elem;

    int length;

    int listsize;

}SqList;

int InitList_Sq(SqList &L)                                    //InitList_Sq() function

{   //Inititial a Sq_List

    L.elem=(int *)malloc(LIST_INIT_SIZE *sizeof(int));

    if (!L.elem) return(0);

    L.length=0;

    L.listsize=LIST_INIT_SIZE;

    return(1);

}//end of InitList_Sq() function

-------------------------本函数的重点----------------------- 

int ListDelete_Sq(SqList &L, int i, ElemType &e){

    ElemType *p,*q;

    if( i<1 || i>L.length){

        printf("The Entry you want to Delete is not exsit\n");

        return 0;

    }

    e=L.elem[i-1];          // 提取要删除项的内容

    q=&L.elem[L.length-1];  // 最后一项的地址

    for(p=&L.elem[i];p<=q;++p)  // 从要删除项的后一项开始每项都往前放一个位置

        *(p-1)=*p;

    --L.length;

    return 1;

}

-------------------------本函数的重点----------------------- 
void main()                                             //main() function

{

   SqList L;

   int e;

   int i,j;

   //L.elem=array;

   //L.length=LIST_INIT_LENGTH;

   cout<<"ListDelete_Sq.cpp"<<endl<<"================="<<endl<<endl;

   InitList_Sq(L);

   cout<<"Please input the Length of Demo SqList L: <eg. 5> ";

   cin>>L.length;

   cout<<"Please input the data of Demo SqList L: <eg. {34,54,30,2,40,...}> "<<endl;

   for(j=0;j<L.length;j++)

     cin>>L.elem[j];

   cout<<endl;

   cout<<"Success to create a SqList:"<<endl;

   cout<<"Please input the NO.i element of Sq_List to delete:  <eg. 3> ";

   cin>>i;

   ListDelete_Sq(L,i,e);

   printf("---the data you delete is----------%d \n",e);

   cout<<"The SqList After Delete is:  ";

   for(j=0;j<L.length;j++)

      cout<<L.elem[j]<<"  ";

   cout<<endl<<"...OK...!"<<endl;

   getch();

}//end of main() function

#include <stdlib.h>

#define MAXSIZE 20

#define MAX_LENGTH 100

typedef int RedType;

typedef struct SqList{

 RedType r[MAXSIZE+1];

 int length;

}SqList;

// 此处用指针或者引用都可以，但是不能直接用结构来作为参数传人 InsertSort(SqList &L):OK  InsertSort(SqList L):ERROR, 没法正常工作

/*

用结构来做，比较常用

void main()

{

 int i;

 SqList L;

 printf("\nPlease input the length you want to sort\n");

 scanf("%d",&L.length);

 for(i=1;i<=L.length;i++){

  printf("\nPlease input the %dth data\n",i);

  scanf("%d",&L.r[i]);

 }

 printf("\nYou input data is:");

 for(i=1;i<=L.length;i++)

  printf("%5d",L.r[i]);

 InsertSort(&L);

 printf("\nThe sorted data is:");

 for(i=1;i<=L.length;i++)

  printf("%5d",L.r[i]);

}

*/

void SelectSort(SqList *L);

// 用指针来做

void main()

{

 int i;

 SqList *L;

 if(!(L=(SqList *)malloc(sizeof(SqList)))){

  printf("OverFlow\n");

  return;

 }

 printf("\nPlease input the length you want to sort\n");

 scanf("%d",&L->length);

 for(i=1;i<=L->length;i++){

  printf("\nPlease input the %dth data\n",i);

  scanf("%d",&L->r[i]);

 }

 printf("\nYou input data is:");

 for(i=1;i<=L->length;i++)

  printf("%5d",L->r[i]);

 SelectSort(L);

 printf("\nThe sorted data is:");

 for(i=1;i<=L->length;i++)

  printf("%5d",L->r[i]);

 free(L);

}

void SelectSort(SqList *L)    //SelectSort() sub-function

{   int i,j,k,temp;

    for(i=1;i<=L->length;++i)

    {   k=i;

       for(j=i+1;j<=L->length;++j)

          if(L->r[j]<L->r[k])

              k=j;

       if(i!=k)

       {   temp=L->r[i];

           L->r[i]=L->r[k];

           L->r[k]=temp;

       }

    }

}//SelectSort() end

int Patition(SqList &L, int low, int high){

// 交换顺序表 L 中子表 L.r[low...high] 的记录，使枢轴记录到位，并返回其所在位 // 置，此时它之前（后）的记录均不大（小）于它。

    piovtkey=L.r[low].key;

    while(low<high){

       while(low<high && L.r[high].key>=piovtkey)

           --high;

       // 退出上面的循环，说明 L.r[high].key<piovtkey, 从而应该和 L.[row] 交 // 换即把比枢轴记录小的记录交换到低端

       L.r[low]<---->L.r[high] ；

       while(low<high && L.r[low].key <= piovtkey)

           ++low;

// 退出上面的循环，说明 L.r[high].key<piovtkey, 从而应该和 L.[row] 交

// 换即把比枢轴记录小的记录交换到低端

       L.r[row]<----->L.r[high];

    }

    return low;// 此时 low == high

}//Patition

#include <stdlib.h>

#define MAXSIZE 20

#define MAX_LENGTH 100

typedef int RedType;

typedef struct SqList{

       RedType r[MAXSIZE+1];

       int length;      

}SqList;

// 此处用指针或者引用都可以，但是不能直接用结构来作为参数传人 InsertSort(SqList &L):OK  InsertSort(SqList L):ERROR, 没法正常工作

void BiInsertSort(SqList *L) 

{  int i,j,low,high,mid;

   for(i=2;i<=L->length;++i)

       if(L->r[i]<L->r[i-1]){

                     L->r[0] = L->r[i];

                     high=i-1;

                     low=1;

                     while(low<=high){

                            mid=(low+high)/2;

                            if(L->r[0]<L->r[mid])

                                   high=mid-1;

                            else

                                   low=mid+1;

                     }

                     for(j=i-1;j>=high+1;--j)

                            L->r[j+1]=L->r[j];

                     L->r[high+1]=L->r[0];

          }

}

/*

用结构来做，比较常用

void main()

{

       int i;

       SqList L;

       printf("\nPlease input the length you want to sort\n");

       scanf("%d",&L.length);

       for(i=1;i<=L.length;i++){

              printf("\nPlease input the %dth data\n",i);

              scanf("%d",&L.r[i]);

       }

       printf("\nYou input data is:");

       for(i=1;i<=L.length;i++)

              printf("%5d",L.r[i]);

       BiInsertSort(&L);

       printf("\nThe sorted data is:");

       for(i=1;i<=L.length;i++)

              printf("%5d",L.r[i]);

}

*/

// 用指针来做

void main()

{

       int i;

       SqList *L;

       if(!(L=(SqList *)malloc(sizeof(SqList)))){

              printf("OverFlow\n");

              return;

       }

       printf("\nPlease input the length you want to sort\n");

       scanf("%d",&L->length);

       for(i=1;i<=L->length;i++){

              printf("\nPlease input the %dth data\n",i);

              scanf("%d",&L->r[i]);

       }

       printf("\nYou input data is:");

       for(i=1;i<=L->length;i++)

              printf("%5d",L->r[i]);

       BiInsertSort(L);

       printf("\nThe sorted data is:");

       for(i=1;i<=L->length;i++)

              printf("%5d",L->r[i]);

       free(L);

}

#define MAXSIZE 20
#define MAX_LENGTH 100

typedef int RedType;
typedef struct SqList{
 RedType r[MAXSIZE+1];
 int length; 
}SqList;

//此处用指针或者引用都可以，但是不能直接用结构来作为参数传人 InsertSort(SqList &L):OK  InsertSort(SqList L):ERROR,没法正常工作
void InsertSort(SqList *L) 
{  int i,j;
   for(i=2;i<=L->length;++i)
       if(L->r[i]<L->r[i-1])
       {  L->r[0]=L->r[i];
   for(j=i-1;L->r[0]<L->r[j];--j)
      L->r[j+1]=L->r[j];
   L->r[j+1]=L->r[0];
       }
}

/*
用结构来做，比较常用
void main()
{
 int i;
 SqList L;
 printf("\nPlease input the length you want to sort\n");
 scanf("%d",&L.length);
 for(i=1;i<=L.length;i++){
  printf("\nPlease input the %dth data\n",i);
  scanf("%d",&L.r[i]);
 }
 printf("\nYou input data is:");
 for(i=1;i<=L.length;i++)
  printf("%5d",L.r[i]);
 InsertSort(&L);
 printf("\nThe sorted data is:");
 for(i=1;i<=L.length;i++)
  printf("%5d",L.r[i]);
 
}
*/

//用指针来做
void main()
{
 int i;
 SqList *L;
 if(!(L=(SqList *)malloc(sizeof(SqList)))){
  printf("OverFlow\n");
  return;
 }
 printf("\nPlease input the length you want to sort\n");
 scanf("%d",&L->length);
 for(i=1;i<=L->length;i++){
  printf("\nPlease input the %dth data\n",i);
  scanf("%d",&L->r[i]);
 }
 printf("\nYou input data is:");
 for(i=1;i<=L->length;i++)
  printf("%5d",L->r[i]);
 InsertSort(L);
 printf("\nThe sorted data is:");
 for(i=1;i<=L->length;i++)
  printf("%5d",L->r[i]);
 free(L);
 
}

void BubbleSort(Elem R[], int n){
 i=n;
 while(i>1){
  LastExchange = 1;
  for(j=1; j<i; j++){
   if(R[j+1]<R[j]){
    Swap(R[j],R[j+1]);
    LastExchange=j;
   }
  }
  i=LastExchange;
 
 }//while
}//BubbleSort
起泡排序的结束条件是：最后一趟没有进行“交换”

void ShellSort(SqList &L, int dlta[], int t){
 //增量序列dlta[0...t-1]对顺序表L作希尔排序
 for(k=0;k<t;++k)
  ShellInsert(L,dlta[k]);
}//ShellSort

#define MAX_LENGTH 100
typedef int KeyType;

typedef struct {
 KeyType *elem;
 int length; 
}SSTable; //顺序表的存储结构

#define EQ(a, b) ((a) == (b))
#define LT(a, b) ((a) < (b))
#define LQ(a, b) ((a) <= (b)) 

int Search_Seq(SSTable ST, KeyType key){
 int mid,low,high;
 low = 1;
 high = ST.length;
 
 
 while(low <= high){
  mid = (low + high)/2;
  if(EQ(key, ST.elem[mid]))
   return mid;  //找到数据所在的位置
  else if(LT(key, ST.elem[mid]))
   high = mid - 1;
  else
   low = mid + 1; 
 }
 return 0; //没有找到数据
}

void main()
{
 int i, key;
 SSTable T;
 T.elem = (KeyType *)malloc(sizeof(KeyType));
 printf("How Many Entries Do You Want input\n");
 scanf("%d", &T.length);
 for(i=1; i<=T.length; i++){
  printf("Please input the %dth entries \n", i);
  scanf("%d", &T.elem[i]);
 }
 for (i=1; i<=T.length; i++)
  printf("%5d",T.elem[i]); //显示已经输入的所有数据
 printf("\nPlease input the data you want to search\n");
 scanf("%d", &key);
 i = Search_Seq(T,key);
 printf("the search data is locate the %dth(0 indicate can not find)\n",i); 
}

#define MAX_LENGTH 100
typedef int KeyType;

typedef struct {
 KeyType *elem;
 int length; 
}SSTable; //顺序表的存储结构

/*
此算法比第二个算法多了一个判定i是否出界的流程，对于查找数目较少的情况，
二者查找时间相差不大，对于存在大量数据时，该算法的主要查找时间消耗再判
定是否出界上，所以第二个算法明显比第一个算法好，唯一增加的就是一个“哨兵”
数据。
int Search_Seq(SSTable ST, KeyType key){
 int i;
 for(i=1; i<=ST.length && ST.elem[i] != key; i++ )
  ;
 if(i<=ST.length)
  return i;
 else
  return 0;
}
*/

int Search_Seq(SSTable ST, KeyType key){
 int i;
 ST.elem[0] = key; //“哨兵”，如果顺序表中不存在要查找的数据的话，则查找指针必定指向该哨兵
 for(i = ST.length; ST.elem[i] != key; i--)
  ;
 return i;  //找到的话，则i != 0,否则i = 0
}

void main()
{
 int i, key;
 SSTable T;
 T.elem = (KeyType *)malloc(sizeof(KeyType));
 printf("How Many Entries Do You Want input\n");
 scanf("%d", &T.length);
 for(i=1; i<=T.length; i++){
  printf("Please input the %dth entries \n", i);
  scanf("%d", &T.elem[i]);
 }
 for (i=1; i<=T.length; i++)
  printf("%5d",T.elem[i]); //显示已经输入的所有数据
 printf("\nPlease input the data you want to search\n");
 scanf("%d", &key);
 i = Search_Seq(T,key);
 printf("the search data is locate the %dth(0 indicate can not find)\n",i); 
}

typedef int    TElemType;
//typedef 1 OK;
//typedef 0 ERROR;

#define OK 1;
#define ERROR 0;

typedef struct BiTNode {
 TElemType data;
 struct BiTNode  *lchild, *rchild;
}BiTNode;

int PrintElem(TElemType e){
 printf("Node Elem is %d", e);
 return OK; 
}

int PreOderTraverse(BiTNode *tree, int(* PrintElem)(TElemType e)){
 if(tree){
  if(PrintElem(tree->data))
   if(PreOderTraverse(tree->lchild, PrintElem))
    if(PreOderTraverse(tree->rchild,PrintElem))
     return OK;
  return ERROR;
       
 }
 else
  return OK;
}

//Create New Tree;

int CreateBiTree(BiTNode *tree){
 BiTNode *T;
 printf("please input int data to create bitree, enter 0 for finishing\n");
 TElemType i;
 scanf("%d",&i);
 if (i == 0){
  T = NULL;
  printf("Tree is NULL \n ");
  return ERROR;
 }
 else {
  if(!(T = (BiTNode *)malloc(sizeof(BiTNode)))){
   printf("OverFlow\n");
   return ERROR;
  }
  T->data = i;
  CreateBiTree(T->lchild);
  CreateBiTree(T->rchild);
  
 }//else end
}

void main()
{ 
 BiTNode *Tree;
 printf("input data to create a new BiTree \n");
 CreateBiTree(Tree);
 PreOderTraverse(Tree,PrintElem);
 return ;
}