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

第1章  緒論                  
 1.1  數(shù)據(jù)結(jié)構(gòu)概述                  
 1.1.1  學習數(shù)據(jù)結(jié)構(gòu)課程的意義                  
 1.1.2  數(shù)據(jù)結(jié)構(gòu)課程的特點                  
 1.2  研究對象                  
 1.3  算法的描述和分析                  
 1.3.1  算法的描述                  
 1.3.2  算法的分析                  
 本章小結(jié)                  
 習題                  
 第2章  線性結(jié)構(gòu)之一 ——  順序表                  
 2.1  基本概念                  
 2.1.1  線性表                  
 2.1.2  線性表的運算                  
 2.1.3  線性表的存儲                  
 2.2  順序表                  
 2.2.1  順序表的存儲                  
 2.2.2  順序表的運算                  
 2.2.3  順序表的應(yīng)用                  
 2.3  棧和隊                  
 2.3.1  棧和隊的概念                  
 2.3.2  棧和隊的特點                  
 2.3.3  棧和隊的存儲                  
 2.3.4  棧和隊的運算                  
 2.3.5  棧和隊的應(yīng)用                  
 本章小結(jié)                  
 習題                  
 第3章  線性結(jié)構(gòu)之二 ——  鏈表                  
 3.1  鏈表的存儲及運算                  
 3.1.1  鏈表的存儲                  
 3.1.2  鏈表的運算                  
 3.2  鏈接的棧和隊                  
 3.2.1  鏈接棧和隊的邏輯表示                  
 3.2.2  鏈接棧和隊的存儲                  
 3.2.3  鏈接棧和隊的運算                  
 3.3  鏈表的推廣                  
 3.3.1  帶頭結(jié)點的鏈表                  
 3.3.2  循環(huán)鏈表                  
 3.3.3  雙向鏈表                  
 3.3.4  多重鏈表                  
 3.4  鏈表的應(yīng)用                  
 3.4.1  一元多項式的表示及相加                  
 3.4.2  位組排序                  
 3.5  用數(shù)組實現(xiàn)鏈表                  
 3.5.1  鏈表的數(shù)組存儲及運算                  
 3.5.2  存儲池                  
 本章小結(jié)                  
 習題                  
 第4章  層次結(jié)構(gòu) —— 樹                  
 4.1  樹的概念                  
 4.2  二叉樹                  
 4.2.1  二叉樹的概念                  
 4.2.2  二叉樹的存儲                  
 4.2.3  二叉樹的性質(zhì)                  
 4.2.4  一般樹的二叉樹表示                  
 4.2.5  二叉樹的運算                  
 4.2.6  二叉樹的其他存儲及運算                  
 4.3  樹的應(yīng)用                  
 4.3.1  二叉排序樹                  
 4.3.2  堆排序                  
 4.3.3  哈夫曼樹及運算                  
 4.3.4  決策樹                  
 4.3.5  博弈樹                  
 本章小結(jié)                  
 習題                  
 第5章  網(wǎng)狀結(jié)構(gòu) —— 圖                  
 5.1  圖的概念                  
 5.2  圖的存儲                  
 5.2.1  鄰接矩陣法                  
 5.2.2  鄰接表法                  
 5.2.3  十字鏈表法                  
 5.3  圖的遍歷                  
 5.3.1  深度優(yōu)先遍歷                  
 5.3.2  廣度優(yōu)先遍歷                  
 5.3.3  生成樹                  
 5.4  最短路徑                  
 5.4.1  某源點到其余各頂點的最短路徑                  
 5.4.2  每對頂點間的最短路徑                  
 5.5  拓撲排序                  
 5.5.1  拓撲排序的概念                  
 5.5.2  拓撲排序的算法                  
 5.6  關(guān)鍵路徑                  
 5.6.1  關(guān)鍵路徑的概念                  
 5.6.2  關(guān)鍵路徑的算法                  
 本章小結(jié)                  
 習題                  
 第6章  文件組織                  
 6.1  文件的結(jié)構(gòu)                  
 6.1.1  文件的邏輯結(jié)構(gòu)                  
 6.1.2  文件的物理結(jié)構(gòu)                  
 6.1.3  文件的組織                  
 6.2  順序文件和隨機文件                  
 6.2.1  順序文件                  
 6.2.2  隨機文件                  
 6.3  索引技術(shù)                  
 6.3.1  索引的概念                  
 6.3.2  順序索引                  
 6.3.3  散列索引                  
 6.3.4  二叉樹索引                  
 6.3.5  B樹索引                  
 6.4  索引文件                  
 6.4.1  索引文件                  
 6.4.2  索引順序文件                  
 6.5  散列文件                  
 本章小結(jié)                  
 習題