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

第1章  緒論                  
 1.1  常用術(shù)語                  
 1.2  算法描述                  
 1.3  算法評(píng)價(jià)                  
 1.3.1  正確性                  
 1.3.2  健壯性                  
 1.3.3  可讀性                  
 1.3.4  時(shí)間復(fù)雜度                  
 1.3.5  空間復(fù)雜度                  
 本章小結(jié)                  
 習(xí)題1                  
 第2章  集合                  
 2.1  集合的定義和運(yùn)算                  
 2.1.1  集合的定義                  
 2.1.2  集合的抽象數(shù)據(jù)類型                  
 2.1.3  集合運(yùn)算舉例                  
 2.2  集合的順序存儲(chǔ)結(jié)構(gòu)和操作實(shí)現(xiàn)                  
 2.3  集合的鏈接存儲(chǔ)結(jié)構(gòu)和操作實(shí)現(xiàn)                  
 本章小結(jié)                  
 習(xí)題2                  
 第3章  線性表                  
 3.1  線性表的定義和抽象數(shù)據(jù)類型                  
 3.1.1  線性表的定義                  
 3.1.2  線性表的抽象數(shù)據(jù)類型                  
 3.2  線性表的順序存儲(chǔ)結(jié)構(gòu)和操作實(shí)現(xiàn)                  
 3.3  線性表的鏈接存儲(chǔ)結(jié)構(gòu)和操作實(shí)現(xiàn)                  
 3.4  線性表的其他鏈接存儲(chǔ)結(jié)構(gòu)                  
 3.5  線性表應(yīng)用舉例——多項(xiàng)式計(jì)算                  
 3.6  廣義表                  
 3.6.1  廣義表的定義                  
 3.6.2  廣義表的存儲(chǔ)結(jié)構(gòu)                  
 3.6.3  廣義表的運(yùn)算                  
 本章小結(jié)                  
 習(xí)題3                  
 第4章  棧和隊(duì)列                  
 4.1  棧                  
 4.1.1  棧的定義                  
 4.1.2  棧的抽象數(shù)據(jù)類型                  
 4.2  棧的順序存儲(chǔ)結(jié)構(gòu)和操作實(shí)現(xiàn)                  
 4.3  棧的鏈接存儲(chǔ)結(jié)構(gòu)和操作實(shí)現(xiàn)                  
 4.4  棧的簡(jiǎn)單應(yīng)用舉例                  
 4.5  算術(shù)表達(dá)式的計(jì)算                  
 4.5.1  算術(shù)表達(dá)式的兩種表示                  
 4.5.2  后綴表達(dá)式求值的算法                  
 4.5.3  把中綴表達(dá)式轉(zhuǎn)換為后綴表達(dá)式的算法                  
 4.6  棧與遞歸                  
 4.7  隊(duì)列                  
 4.7.1  隊(duì)列的定義                  
 4.7.2  隊(duì)列的抽象數(shù)據(jù)類型                  
 4.7.3  隊(duì)列的順序存儲(chǔ)結(jié)構(gòu)和操作實(shí)現(xiàn)                  
 4.7.4  隊(duì)列的鏈接存儲(chǔ)結(jié)構(gòu)和操作實(shí)現(xiàn)                  
 4.7.5  隊(duì)列的應(yīng)用簡(jiǎn)介                  
 本章小結(jié)                  
 習(xí)題4                  
 第5章  樹和二叉樹                  
 5.1  樹的概念                  
 5.1.1  樹的定義                  
 5.1.2  樹的表示                  
 5.1.3  樹的基本術(shù)語                  
 5.1.4  樹的性質(zhì)                  
 5.2  二叉樹                  
 5.2.1  二叉樹的定義                  
 5.2.2  二叉樹的性質(zhì)                  
 5.2.3  二叉樹的抽象數(shù)據(jù)類型                  
 5.2.4  二叉樹的存儲(chǔ)結(jié)構(gòu)                  
 5.3  二叉樹遍歷                  
 5.4  二叉樹其他運(yùn)算                  
 5.5  樹的存儲(chǔ)結(jié)構(gòu)和運(yùn)算                  
 5.5.1  樹的抽象數(shù)據(jù)類型                  
 5.5.2  樹的存儲(chǔ)結(jié)構(gòu)                  
 5.5.3  樹的運(yùn)算                  
 本章小結(jié)                  
 習(xí)題5                  
 第6章  二叉樹的應(yīng)用                  
 6.1  二叉搜索樹                  
 6.1.1  二叉搜索樹的定義                  
 6.1.2  二叉搜索樹的抽象數(shù)據(jù)類型                  
 6.1.3  二叉搜索樹的運(yùn)算                  
 6.2  堆                  
 6.2.1  堆的定義                  
 6.2.2  堆的抽象數(shù)據(jù)類型                  
 6.2.3  堆的存儲(chǔ)結(jié)構(gòu)                  
 6.2.4  堆的運(yùn)算                  
 6.3  哈夫曼樹                  
 6.3.1  基本術(shù)語                  
 6.3.2  構(gòu)造哈夫曼樹                  
 6.3.3  哈夫曼編碼                  
 本章小結(jié)                  
 習(xí)題6                  
 第7章  圖                  
 7.1  圖的概念                  
 7.1.1  圖的定義                  
 7.1.2  圖的基本術(shù)語                  
 7.2  圖的存儲(chǔ)結(jié)構(gòu)                  
 7.2.1 鄰接矩陣                  
 7.2.2  鄰接表                  
 7.2.3  邊集數(shù)組                  
 7.3  圖的遍歷                  
 7.3.1  深度優(yōu)先搜索遍歷                  
 7.3.2  廣度優(yōu)先搜索遍歷                  
 7.3.3  非連通圖的遍歷                  
 7.4  圖的生成樹和最小生成樹                  
 7.4.1 普里姆算法                  
 7.4.2  克魯斯卡爾算法                  
 7.5  拓?fù)渑判?nbsp;                 
 本章小結(jié)                  
 習(xí)題7                  
 第8章  查找                  
 8.1  二叉樹                  
 8.2  順序表查找                  
 8.2.1  順序查找                  
 8.2.2  二分查找                  
 8.3  索引查找                  
 8.3.1  索引的概念                  
 8.3.2  索引查找算法                  
 8.3.3  分塊查找                  
 8.4  散列查找                  
 8.4.1  散列的概念                  
 8.4.2  散列函數(shù)                  
 8.4.3  處理沖突的方法                  
 8.4.4  散列表的運(yùn)算                  
 8.5  B樹查找                  
 8.5.1  B－樹的定義                  
 8.5.2  B－樹查找                  
 8.5.3  B－樹的插入                  
 8.5.4  B－樹的刪除                  
 8.5.5  B+樹簡(jiǎn)介                  
 本章小結(jié)                  
 習(xí)題8                  
 第9章  排序                  
 9.1  排序的基本概念                  
 9.2  選擇排序                  
 9.2.1  直接選擇排序                  
 9.2.2  堆排序                  
 9.3  交換排序                  
 9.3.1  氣泡排序                  
 9.3.2  快速排序                  
 9.4  歸并排序                  
 9.5  各種內(nèi)排序方法的比較                  
 9.6  外排序                  
 本章小結(jié)                  
 習(xí)題9                  
 附錄A  部分算法設(shè)計(jì)題參考解答                  
 參考文獻(xiàn)