#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;