Linked List 3 5 typedef struct listnode int

  • Slides: 27
Download presentation
第三章 Linked List

第三章 Linked List

3 -5 動態配置節點實作鏈結串列 動態配置節點，鏈結欄位改為指標 typedef struct listnode { int data; /*資料欄位*/ struct listnode *next;

3 -5 動態配置節點實作鏈結串列 動態配置節點，鏈結欄位改為指標 typedef struct listnode { int data; /*資料欄位*/ struct listnode *next; /*鏈結欄位*/ }NODE; NODE *list. A; 動態配置節點 list. A = (NODE *) malloc( sizeof(NODE)) ; 在C++語言中則可用 new 運算子 list. A = new NODE ; data list. A next

◎串接兩鏈結串列 -- 線性鏈結串列 A p B void List. Concate( NODE *list. A, NODE *list.

◎串接兩鏈結串列 -- 線性鏈結串列 A p B void List. Concate( NODE *list. A, NODE *list. B) { NODE *p = list. A ; while ( p->next != NULL) // p一路往右直到最後一個節點 p = p->next ; p->next = list. B->next ; } // 改變其鏈結

3 -8 雙向鏈結串列 typedef struct dlist_node { struct dlist_node *left; int data; struct dlist_node

3 -8 雙向鏈結串列 typedef struct dlist_node { struct dlist_node *left; int data; struct dlist_node *right; }Dnode; Head 線性雙向鏈結串列 環狀雙向鏈結串列 Head

pa 1. 初始狀態 A 5 4 6. 1 2 5 3. 2 2 2.

pa 1. 初始狀態 A 5 4 6. 1 2 5 3. 2 2 2. 9 1 6 0 pb B 9 ctail C 2. pb->exp(=5) 大於 pa->exp(=4) ，複製 *pb，pb往右一個節點 pa A 5 4 6. 1 2 pb B 9 5 3. 2 2 ctail C 9 5 2. 9 1 6 0

3. pa->exp(=4) 大於 pb->exp(=2) ，複製 *pa，pa往右一個節點 pa A 5 4 6. 1 2 2.

3. pa->exp(=4) 大於 pb->exp(=2) ，複製 *pa，pa往右一個節點 pa A 5 4 6. 1 2 2. 9 1 6 0 pb B 9 5 3. 2 2 ctail C 9 5 5 4 4. pa->exp 等於 pb->exp，新節點係數為 pa->coef 加 pb->coef， pa及pb往右一個節點 pa A 5 4 6. 1 2 2. 9 1 pb B 9 5 3. 2 2 ctail C 9 5 5 4 9. 3 2 6 0

M = 0 -1 0 0 0 2 c 0 0 c 1 1

M = 0 -1 0 0 0 2 c 0 0 c 1 1 r 0 0 r 1 1 r 2 2 0 6 0 3 0 c 2 2 c 3 3 0 2 1 1 0 -1 0 0 0 1 6 c 4 4 5 × 6 c 5 5 0 4 2 1 3 6 2 1 1 r 3 3 r 4 4 2 0 0 3 3 3 4 2 2 3 5 1 4 5 6

typedef struct listnode int value struct listnode nexttypedef struct listnode int value struct listnode next
typedef u typedef l typedef typedef struct charlistnodetypedef u typedef l typedef typedef struct charlistnode
struct linked int data struct linked prev structstruct linked int data struct linked prev struct
typedef typedef typedef int INTEGER int i jtypedef typedef typedef int INTEGER int i j
typedef typedef typedef int INTEGER int i jtypedef typedef typedef int INTEGER int i j
typedef n n n n typedef typedef typedeftypedef n n n n typedef typedef typedef
typedef typedef struct date int year int monthtypedef typedef struct date int year int month
typedef struct int xsize int ysize int leveltypedef struct int xsize int ysize int level
typedef struct int xsize int ysize int leveltypedef struct int xsize int ysize int level
struct node struct node next typedef struct nodestruct node struct node next typedef struct node
3 1 typedef typedef struct char name100 int3 1 typedef typedef struct char name100 int
typedef typedef struct data int x double ytypedef typedef struct data int x double y
typedef int Int A10 Int A a Inttypedef int Int A10 Int A a Int
5 Node typedef struct Node int val struct5 Node typedef struct Node int val struct
typedef struct link int data struct link nexttypedef struct link int data struct link next
typedef struct Tree Node int data struct Treetypedef struct Tree Node int data struct Tree
typedef struct Tree Node int data struct Treetypedef struct Tree Node int data struct Tree
insertanode B typedef struct node int data structinsertanode B typedef struct node int data struct
2394 typedef struct Tree Node int data struct2394 typedef struct Tree Node int data struct
4 List 1 typedef struct list Node list4 List 1 typedef struct list Node list
Double Linked List Double Linked List Linked listDouble Linked List Double Linked List Linked list
LINKED LIST Circular Linked List Circular Linked ListLINKED LIST Circular Linked List Circular Linked List
Single Linked List Linked List Linked List adalahSingle Linked List Linked List Linked List adalah
Double Linked List Double Linked List Linked listDouble Linked List Double Linked List Linked list