實用數(shù)據(jù)結(jié)構(gòu)

第一篇 數(shù)據(jù)結(jié)構(gòu)基礎(chǔ)                  
 第1章 緒論                  
 1·1基本概念                  
 1·2算法的描述                  
 1·3算法的評價                  
 1·3·1評價算法的一般原則                  
 1·3·2算法復雜性的分析                  
 1·4應(yīng)用舉例及分析                  
 小結(jié)                  
 習題                  
 第2章 數(shù)組與線性表                  
 2·1數(shù)組及其順序存儲結(jié)構(gòu)                  
 2·2線性表及其運算                  
 2·2·1線性表(Linear List)                  
 2·2·2線性表的運算                  
 2·3堆棧及其應(yīng)用                  
 2·3·1堆棧(Stack)                  
 3·3·2堆棧的應(yīng)用                  
 2·4隊列及其應(yīng)用                  
 2·4·1隊列(Queue)                  
 2·4·2循環(huán)隊列                  
 2·4·3隊列的應(yīng)用                  
 2·5應(yīng)用實例及分析                  
 小結(jié)                  
 習題                  
 第3章 鏈表                  
 3·1單鏈表及其運算                  
 3·1·1單鏈表                  
 3·1·2單鏈表的基本運算                  
 3·2循環(huán)鏈表與雙向鏈表                  
 3·2·1循環(huán)鏈表                  
 3·2·2雙鏈表                  
 3·3鏈表應(yīng)用舉例                  
 3·3·1鏈堆棧                  
 3·3·2鏈隊列                  
 3·3·3一元多項式的算術(shù)運算                  
 3·4表示稀疏矩陣的十字鏈表                  
 3·5應(yīng)用舉例及分析                  
 小結(jié)                  
 習題                  
 第4章 串                  
 4·1串的定義及其基本運算                  
 4·2串的存儲結(jié)構(gòu)                  
 4·2·1串的順序存儲結(jié)構(gòu)                  
 4·2·2串的鏈接存儲結(jié)構(gòu)                  
 4·3串的匹配運算                  
 4·4應(yīng)用實例及分析                  
 小結(jié)                  
 習題                  
 第5章 樹                  
 5·1樹的定義和基本術(shù)語                  
 5·2二叉樹                  
 5·2·1二叉樹的定義及其性質(zhì)                  
 5·2·2二叉樹的存儲結(jié)構(gòu)                  
 5·2·3普通樹與二叉樹的轉(zhuǎn)換                  
 5·3二叉樹的遍歷                  
 5·3·1二叉樹的遍歷                  
 5·3·2利用堆棧的非遞歸遍歷過程                  
 5·4線索二叉樹                  
 5·5樹的應(yīng)用                  
 5·5·1二叉排序樹                  
 5·5·2哈夫曼樹                  
 5·6應(yīng)用實例及分析                  
 小結(jié)                  
 習題                  
 第6章 圖                  
 6·1圖的定義和基本術(shù)語                  
 6·2圖的存儲方式                  
 6·2·1鄰接矩陣                  
 6·2·2鄰接表                  
 6·3圖的遍歷                  
 6·3·1深度優(yōu)先搜索                  
 6·3·2廣度優(yōu)先搜索(BFS)                  
 6·4最小生成樹                  
 6·5最短路徑                  
 6·6拓撲排序                  
 6·7關(guān)鍵路徑法                  
 6·8應(yīng)用實例與分析                  
 小結(jié)                  
 習題                  
 第7章 排序                  
 7·1排序的基本概念                  
 7·2三種簡單排序方法                  
 7·2·1簡單選擇排序                  
 7·2·2冒泡排序                  
 7·2·3直接插入排序                  
 7·3堆排序                  
 7·3·1堆的概念                  
 7·3·2構(gòu)建堆的過程                  
 7·3·3利用堆排序                  
 7·4快速排序                  
 7·5歸并排序                  
 7·6基數(shù)排序                  
 7·7應(yīng)用實例及分析                  
 小結(jié)                  
 習題                  
 第8章 查找                  
 8·1查找的基本概念                  
 8·2基本查找方法                  
 8·2·1順序查找                  
 8·2·2二分查找                  
 8·2·3分塊查找                  
 8·3樹型查找                  
 8·3·1二又排序樹查找                  
 8·3·2平衡樹                  
 8·3·3B樹                  
 8·4散列法                  
 8·4·1散列法                  
 8·4·2散列函數(shù)構(gòu)造方法                  
 8·4·3處理沖突的方法                  
 8·4·4散列法的查找運算                  
 8·5應(yīng)用舉例及分析                  
 小結(jié)                  
 習題                  
 第二篇 上機指導與習題解答                  
 第9章 實驗內(nèi)容與上機指導                  
 9·1線性表及其運算                  
 9·2鏈表及其運算                  
 9·3二又樹的存儲與遍歷                  
 9·4圖的存儲與遍歷                  
 9·5排序                  
 9·6查找                  
 習題解答                  
 主要參考文獻