資料結構三

一、關於線性表中單鏈表的頭插法和尾插法

#include "stdio.h"
#include "stdlib.h"

struct LNode{
    int data;
    struct LNode* next;
};
//建立一個節點
struct LNode* CreateNode(int e){
    struct LNode* p=(struct LNode*) malloc(sizeof(struct LNode));
    if(p==NULL){
        printf("No enough memory to allocate!\n");
        exit(0);
    }
    p->data=e;
    p->next=NULL;
    return p;
}
//尾插法插入元素
struct LNode* ListTailInsert(struct LNode* L){
    struct LNode* p=L,*s=NULL;
    int x=-1;
    scanf("%d",&x);
    while (x!=9999){
        s= CreateNode(x);
        p->next=s;
        p=s;
        scanf("%d",&x);
    }
    p->next=NULL;
    return L;
}
//頭插法插入元素
struct LNode* ListHeadInsert(struct LNode* L){
    struct LNode* p=L,*s=NULL;
    int x=-1;
    scanf("%d",&x);
    while (x!=9999){
        s= CreateNode(x);
        s->next=p->next;
        p->next=s;
        scanf("%d",&x);
    }
    return L;
}
//遍歷所有元素的值
void ListDisplay(struct LNode* L){
    struct LNode* p=L->next;
    int j=1;
    while (p!=NULL){
        printf("The single-linked-list which has head has %dth node which data is %d.\n",j,p->data);
        p=p->next;
    }
}
//釋放所有的元素
void DeleteMemory(struct LNode* L){
    struct LNode* p=L,* pr=NULL;
    while (p!=NULL){
        pr=p;
        p=p->next;
        free(pr);
    }
}
int main(){
    printf("-----------Head insertion-------------\n");
    struct LNode* L= NULL;//宣告一個指向單鏈表的指標
    //1.建立帶頭節點的單鏈表
    L=CreateNode(0);//初始化空的單鏈表
    //2.尾插法進行操作
    L= ListTailInsert(L);
    //3.遍歷輸出所有節點資訊
    ListDisplay(L);
    //4.釋放所有節點
    DeleteMemory(L);
    printf("-----------Tail insertion-------------\n");
    struct LNode* S=NULL;//宣告一個指向單鏈表的指標
    //1.建立帶頭節點的單鏈表
    S= CreateNode(0);
    //2.頭插法進行操作
    S=ListHeadInsert(S);
    //3.遍歷輸出所有的元素
    ListDisplay(S);
    //4.釋放記憶體空間
    DeleteMemory(S);
    return 0;
}
 

實現結果：

D:\project\clion\ch1\cmake-build-debug\single_linked_list_created.exe
-----------Head insertion-------------
1
2
3
5
9999
The single-linked-list which has head has 1th node which data is 1.
The single-linked-list which has head has 1th node which data is 2.
The single-linked-list which has head has 1th node which data is 3.
The single-linked-list which has head has 1th node which data is 5.
-----------Tail insertion-------------
3
5
2
10
9999
The single-linked-list which has head has 1th node which data is 10.
The single-linked-list which has head has 1th node which data is 2.
The single-linked-list which has head has 1th node which data is 5.
The single-linked-list which has head has 1th node which data is 3.

Process finished with exit code 0
 

注：頭插法的一個重要應用就是連結串列的逆序輸出