ass="gap"></div><div class="content singlePage wk-container" data-page="23"> <div class="xreadercontent sf-edu-wenku-id-page23" data-status="loading"> <p class="txt"> deletion 删除 </p> <p class="txt"> dense graph 稠密图 </p> <p class="txt"> depth 深度 </p> <p class="txt"> deque(double-ended queue) 双端列表descentdant 子孙 </p> <p class="txt"> destination 终点 </p> <p class="txt"> digital analysis method 数字分析法 </p> <p class="txt"> digital search tree 数字查找树 </p> <p class="txt"> digraph(directed graph) 有向图diminishing increment sort 随小增量排序direct access file 直接存取文件 </p> <p class="txt"> directed acyclic graph 有向无环图directory structure 目录结构 </p> <p class="txt"> division method 除法 </p> <p class="txt"> doubly linked list 双向链表 </p> <p class="txt"> doubly linked tree 双链树 </p> <p class="txt"> edge 边 </p> <p class="txt"> external sort 外部排序 </p> <p class="txt"> file 文件 </p> <p class="txt"> first-out list 先进先出表(队列)first-in first-out list 后进先出表(队列)last-in fixed-aggregate data type 固定聚合数据类型folding method 折叠法 </p> <p class="txt"> forest 森林 </p> <p class="txt"> front 队头 </p> <p class="txt"> full binary tree 满二叉树 </p> <p class="txt"> generalized list 广义表 </p> <p class="txt"> grabh 图 </p> <p class="txt"> hash funticion 散列函数 </p> <p class="txt"> hash search 散列查找 </p> <p class="txt"> hash table 散列表 </p> <p class="txt"> head 弧头 </p> <p class="txt"> head node 头结点 </p> <p class="txt"> head pointer 头指针 </p> <p class="txt"> heap sort 堆排序 </p> <p class="txt"> Huffman tree 哈夫曼树 </p> <p class="txt"> immediate predecessor 直接前趋immediate successor 直接后继immediately allocating method 直接定址法incident edge 关联边 </p> <p class="txt"> indegree 入度 </p> <p class="txt"> indexed file 索引文件 </p> <p class="txt"> indexed non-sequential file 索引非顺序文件indexed sequential file 索引顺序文件 </p> </div></div><div class="sf-edu-wenku-id-ad23to24"></div><div class="gap"></div><div class="content singlePage wk-container" data-page="24"> <div class="xreadercontent sf-edu-wenku-id-page24" data-status="loading"> <p class="txt"> initial node 初始结点 </p> <p class="txt"> inorder traversal 中序遍历 </p> <p class="txt"> insertion 插入 </p> <p class="txt"> insertion sort 插入排序 </p> <p class="txt"> internal sort 内部排序 </p> <p class="txt"> inverted file 倒排文件 </p> <p class="txt"> leaf 叶子 </p> <p class="txt"> level 层次 </p> <p class="txt"> linear linked list 线性链表 </p> <p class="txt"> linear list 线性表 </p> <p class="txt"> linear structure 线性结构 </p> <p class="txt"> link 链 </p> <p class="txt"> li