术语表
# 常见数据结构术语中英对照表
- 数据: Data
- 数据元素: Data element
- 数据项: Data item
- 数据结构: Data structure
- 逻辑结构: Logical structure
- 数据类型: Data type
- 指针: Pointer
- 顺序存储结构: Sequential storage structure
- 链状存储结构: Linked storage structure
- 稠密索引: Dense index
- 稀疏索引: Sparse index
- 抽象数据类型: Abstract DataType
- 算法: Algorithm
- 正确性: Correctness
- 可读性: Readability
- 健壮性: Robustness
- 频度: Frequency count
- 时间复杂度: Time complexity
- 空间复杂度: Space complexity
- 直接前驱: Immediate predecessor
- 线性表: Linear list
- 顺序表: Sequenatial list
- 单链表: Singly linked list
- 循环链表: Circylar linked lists
- 双向链表: Double linked lists
- 双向循环链表: Double circular linked list
- 栈: Stack
- 栈顶: Top
- 栈底: Botton
- 后进先出: Last In First Out
- 上溢: Overflow
- 下溢: Underflow
- 共享: Shared
- 队列: Queue
- 队尾: Rear
- 队头: Front
- 先进后出: First In Last Out
- 串: String
- 子串: Substring
- 模式匹配: Pattern matching
- 数组: Arrays
- 行为主序: Row major order
- 列为主序: Column major order
- 稀疏矩阵: Sparse matrices
- 特殊矩阵: Special matrices
- 三元组表: List of 3_tuples
- 十字链表: Orthogonal list
- 广义表: Generalized lists
- 树: Tree
- 二叉树: Binary tree
- 满二叉树: Full binary tree
- 完全二叉树: Complete binary tree
- 二叉排序树: Binary sort tree
- 二叉搜索树: Binary search tree
- 前序遍历: Preorder traversal
- 中序遍历: Inorder traversal
- 后序遍历: Postorder traversal
- 哈夫曼树: Huffman tree
- 回溯: Backtrackins
- 图: Graph
- 有向图: Directed graph (digraph)
- 无向图: Undirected graph (undigraph)
- 有向完全图: Undirected Complete Graph
- 无向完全图: directed complete graph
- 稀疏图: Sparse graph
- 稠密图: Dense graph
- 网点: Network
- 邻结点: Adjacent
- 度: Degree
- 出度: Outdegree
- 入度: Indegree
- 连通图: Connected graph
- 连通分支: Connected component
- 强连通图: Strong graph
- 生成树: Spanning tree
- 邻接矩阵: Adjacency lists
- 邻接表: Adjacency lists
- 邻接多重表: Adjacency multilists
- 深度优先索引: Depth-First Search
- 广度优先索引: Breath-First Search
- 最小生成树: Minimum spanning tree
- 最短路径: Shortest path
- 有向无环图: Directed acycline graph
- 拓扑排序: Topological sort
- 检索: Searching
- 关键字: Key
- 主关键字: Primary key
- 顺序检索: Sequential search
- 折半检索: Binary search
- 分块检索: Blocking search
- 平衡二叉树: Best wishes alanced binary tree
- 平衡因子: Balanced factor
- 直接定址: Immediately allocate
- 除留余数法: Division method
- 数字分析法: Digit analysis method
- 折叠法: Folding method
- 线性探查: Linear probing
- 平方取中法: Mid-square method
- 开放定址法: Open addressing
- 链地址法: Chaining
- 排序: Sorting
- 直接插入排序: Straight insertion sort
- 希尔排序: Shells method
- 缩小增量排序: Diminishing increment sort
- 折半插入排序: Binary insertion sort
- 二路插入排序: 2_way insertion sort
- 共享插入排序: Shared insertion sort
- 冒泡排序: Bubble sort
- 快速排序: Quick sort
- 选择排序: Selection sort
- 直接选择排序: Straight selection sort
- 树形选择排序: Tree selection sort
- 锦标赛排序: Tournament sort
- 堆排序: Heap sort
- 归并排序: Merging sort
- 二路归并: 2_way merge
- 多路归并: Multi_way merge
- 基数排序: Radix sorting
- 最低位优先: (LSD) Least Significant Digit First
- 最高位优先: (MSD) Most Significant Digit First
- 文件: Files
- 顺序文件: Sequential file
- 索引文件: Indexed file
- 索引顺序存取方法: Indexed Sequential Access Method
- 虚拟存储存取方法: Virtual Storage Access Method
- 散列文件: Hashed file
- 多关键字文件: With more than one key
- 多重表文件: Multilist file
- 倒排文件: Inverted file
- 数据抽象: data abstraction
- 数据元素: data element
- 数据对象: data object
- 数据项: data item
- 数据类型: data type
- 抽象数据类型: abstract data type
- 基本数据类型: atomic data type
- 固定聚合数据类型: fixed-aggregate data type
- 可变聚合数据类型: variable-aggregate data type
- 线性表: linear list
- 栈: stack
- 队列: queue
- 串: string
- 数组: array
- 树: tree
- 图: grabh
- 前趋: predecessor
- 后继: successor
- 直接前趋: immediate predecessor
- 直接后继: immediate successor
- 双端列表: deque (double-ended queue)
- 循环队列: cirular queue
- 指针: pointer
- 先进先出表(队列): first-in first-out list
- 后进先出表(队列): last-in first-out list
- 栈底: bottom
- 栈顶: top
- 压入: push
- 弹出: pop
- 队头: front
- 队尾: rear
- 上溢: overflow
- 下溢: underflow
- 数组: array
- 矩阵: matrix
- 多维数组: multi-dimentional array
- 以行为主的顺序分配: row major order
- 以列为主的顺序分配: column major order
- 三角矩阵: truangular matrix
- 对称矩阵: symmetric matrix
- 稀疏矩阵: sparse matrix
- 转置矩阵: transposed matrix
- 链表: linked list
- 线性链表: linear linked list
- 单链表: single linked list
- 多重链表: multilinked list
- 循环链表: circular linked list
- 双向链表: doubly linked list
- 十字链表: orthogonal list
- 广义表: generalized list
- 链: link
- 指针域: pointer field
- 链域: link field
- 头结点: head node
- 头指针: head pointer
- 尾指针: tail pointer
- 串: string
- 空白(空格)串: blank string
- 空串(零串): null string
- 子串: substring
- 树: tree
- 子树: subtree
- 森林: forest
- 根: root
- 叶子: leaf
- 结点: node
- 深度: depth
- 层次: level
- 二叉树: binary tree
- 平衡二叉树: banlanced binary tree
- 满二叉树: full binary tree
- 完全二叉树: complete binary tree
- 遍历二叉树: traversing binary tree
- 二叉排序树: binary sort tree
- 二叉查找树: binary search tree
- 线索二叉树: threaded binary tree
- 哈夫曼树: Huffman tree
- 有序数: ordered tree
- 无序数: unordered tree
- 判定树: decision tree
- 双链树: doubly linked tree
- 数字查找树: digital search tree
- 树的遍历: traversal of tree
- 先序遍历: preorder traversal
- 中序遍历: inorder traversal
后序遍历 postorder traversal
编辑 (opens new window)
上次更新: 2022/09/26, 19:49:08