/鍊錶的遍歷和陣列類似,就是跑鍊錶/
//輸出單向鍊錶尾結點的值
//輸出單向鍊錶的結點個數#include#include#define n 5
typedef struct nodeelemsn;
elemsn *creatlink(int a)
return h;
}elemsn * printlink(elemsn *h)
return p;
} int main()
; elemsn *head=null,*x;
//正向建立單向鍊錶
head=creatlink(a);
//輸出單向鍊錶
x=printlink(head);
printf("%d",x->data);
return 0;
}
//輸出單向鍊錶的奇數結點個數#include#include#define n 6
typedef struct nodeelemsn;
elemsn *creatlink(int a)
return h;
}int printlink(elemsn *h)
int main()
,x; elemsn *head=null;
//正向建立單向鍊錶
head=creatlink(a);
//輸出單向鍊錶
x=printlink(head);
printf("%d",x);
return 0;
}
//輸出單向鍊錶的最大值(假設資料不重複)#include#include#define n 6
typedef struct nodeelemsn;
elemsn *creatlink(int a)
return h;
}int printlink(elemsn *h)
return cnt;
} int main()
,x; elemsn *head=null;
//正向建立單向鍊錶
head=creatlink(a);
//輸出單向鍊錶
x=printlink(head);
printf("%d",x);
return 0;
}
//逆向輸出單向鍊錶資料域的值#include#include#define n 6
typedef struct nodeelemsn;
elemsn *creatlink(int a)
return h;
}elemsn *printlink(elemsn *h)
} return pmax;
} int main()
; elemsn *head=null,*x;
//正向建立單向鍊錶
head=creatlink(a);
//輸出單向鍊錶
x=printlink(head);
printf("%d",x->data);
return 0;
}
#include#include#define n 6
typedef struct nodeelemsn;
elemsn *creatlink(int a)
return h;
}void printlink(elemsn *h)
} int main()
; elemsn *head=null;
//正向建立單向鍊錶
head=creatlink(a);
//輸出單向鍊錶
printlink(head);
return 0;
}
單向鍊錶的遍歷 查詢
單向鍊錶的建立在這裡不在贅述,詳細請看另一篇文章 單向鍊錶的建立 在本篇文章中,主要通過舉例的方式來幫大家理解單向鍊錶的基本遍歷。本篇文章中建立節點用以下表示 typdef struct node elemsn 例一 輸出單向鍊錶尾節點的值 void printtail elemsn head 傳遞...
單向鍊錶 建立 插入 刪除 遍歷
include include include using namespace std struct list create 新建鍊錶 struct list insert struct list head,struct list temp 插入 struct list deletes struct...
單向鍊錶的新增 刪除與遍歷
unitunit1 inte ce uses windows,messages,sysutils,variants,classes,graphics,controls,forms,dialogs,stdctrls type tform1 class tform memo1 tmemo button1...