数据结构英文术语对照
概述 (Overview)
- 数据结构 - Data Structure (DS)
- 算法 - Algorithm (Algo)
- 抽象数据类型 - Abstract Data Type (ADT)
- 存储结构 - Storage Structure (SS)
- 空间复杂度 - Space Complexity (SC)
- 时间复杂度 - Time Complexity (TC)
- 渐进符号 - Asymptotic Notation (Big-O, Θ, Ω)
- 最好情况 - Best Case (BC)
- 最坏情况 - Worst Case (WC)
- 平均情况 - Average Case (AC)
线性表 (Linear List)
- 线性表 - Linear List (LL)
- 顺序表 - Sequential List (SeqList)
- 单链表 - Singly Linked List (SLL)
- 双链表 - Doubly Linked List (DLL)
- 循环链表 - Circular Linked List (CLL)
- 静态链表 - Static Linked List (StaticLL)
- 线性表的顺序存储结构 - Sequential Storage Structure of Linear List (SeqStorage)
- 线性表的链式存储结构 - Linked Storage Structure of Linear List (LinkedStorage)
- 线性表的基本操作 - Basic Operations of Linear List (Insert, Delete, Search, Update)
- 头节点 - Head Node (head)
- 尾节点 - Tail Node (tail)
- 前驱节点 - Predecessor Node (prev)
- 后继节点 - Successor Node (next)
栈、队列、数组 (Stack, Queue, Array)
- 栈 - Stack (stk)
- 队列 - Queue (que/q)
- 数组 - Array (arr)
- 顺序栈 - Sequential Stack (SeqStack)
- 链栈 - Linked Stack (LinkedStack/LStack)
- 顺序队列 - Sequential Queue (SeqQueue)
- 循环队列 - Circular Queue (CircQueue/CQ)
- 链队列 - Linked Queue (LinkedQueue/LQueue)
- 双端队列 - Double-Ended Queue (Deque)
- 优先队列 - Priority Queue (PQ)
- 稀疏矩阵 - Sparse Matrix (SpMatrix)
- 矩阵的压缩存储 - Compressed Storage of Matrix (CompMatrix)
- 栈顶指针 - Top Pointer (top)
- 队头指针 - Front Pointer (front)
- 队尾指针 - Rear Pointer (rear)
- 多维数组 - Multi-Dimensional Array (MDArray)
串 (String)
- 串 - String (str/s)
- 子串 - Substring (substr)
- 串的存储结构 - Storage Structure of String (StrStorage)
- 串的模式匹配 - String Pattern Matching (PatternMatch)
- KMP算法 - Knuth-Morris-Pratt Algorithm (KMP)
- BM算法 - Boyer-Moore Algorithm (BM)
- Sunday算法 - Sunday Algorithm
- Trie树 - Trie Tree / Prefix Tree (Trie)
- 字典树 - Dictionary Tree (DictTree)
- 后缀数组 - Suffix Array (SA)
- 后缀树 - Suffix Tree (ST)
- next数组 - Next Array (next[])
- 主串 - Main String (mainStr)
- 模式串 - Pattern String (pattern/pat)
树 (Tree)
- 树 - Tree (T)
- 二叉树 - Binary Tree (BT)
- 满二叉树 - Full Binary Tree (FBT)
- 完全二叉树 - Complete Binary Tree (CBT)
- 平衡二叉树 - Balanced Binary Tree / AVL Tree (AVL)
- 二叉搜索树 - Binary Search Tree (BST)
- 二叉树的存储结构 - Storage Structure of Binary Tree (BTStorage)
- 二叉树的遍历 - Traversal of Binary Tree (Traversal)
- 前序遍历 - Preorder Traversal (PreOrder)
- 中序遍历 - Inorder Traversal (InOrder)
- 后序遍历 - Postorder Traversal (PostOrder)
- 层序遍历 - Level Order Traversal (LevelOrder)
- 线索二叉树 - Threaded Binary Tree (TBT)
- 哈夫曼树 - Huffman Tree / Optimal Binary Tree (HuffmanTree)
- 哈夫曼编码 - Huffman Coding (HuffmanCode)
- 红黑树 - Red-Black Tree (RBT)
- 根节点 - Root Node (root)
- 叶节点 - Leaf Node (leaf)
- 左子树 - Left Subtree (lchild/left)
- 右子树 - Right Subtree (rchild/right)
- 树的高度 - Height of Tree (height/h)
- 树的深度 - Depth of Tree (depth/d)
图 (Graph)
- 图 - Graph (G)
- 有向图 - Directed Graph (Digraph/DG)
- 无向图 - Undirected Graph (UG)
- 加权图 - Weighted Graph (WG)
- 邻接矩阵 - Adjacency Matrix (AdjMatrix/AM)
- 邻接表 - Adjacency List (AdjList/AL)
- 图的存储结构 - Storage Structure of Graph (GraphStorage)
- 图的遍历 - Traversal of Graph (GraphTraversal)
- 深度优先搜索 - Depth-First Search (DFS)
- 广度优先搜索 - Breadth-First Search (BFS)
- 最小生成树 - Minimum Spanning Tree (MST)
- Prim算法 - Prim’s Algorithm (Prim)
- Kruskal算法 - Kruskal’s Algorithm (Kruskal)
- 最短路径 - Shortest Path (SP)
- Dijkstra算法 - Dijkstra’s Algorithm (Dijkstra)
- Floyd算法 - Floyd-Warshall Algorithm (Floyd)
- Bellman-Ford算法 - Bellman-Ford Algorithm (BF)
- 拓扑排序 - Topological Sorting (TopSort)
- 关键路径 - Critical Path (CP)
- 顶点 - Vertex (V/v)
- 边 - Edge (E/e)
- 度 - Degree (deg)
- 入度 - In-Degree (indeg)
- 出度 - Out-Degree (outdeg)
- 连通图 - Connected Graph (CG)
- 强连通图 - Strongly Connected Graph (SCG)
搜索 (Search)
- 搜索/查找 - Search (search)
- 顺序查找 - Sequential Search / Linear Search (SeqSearch)
- 二分查找 - Binary Search (BinSearch/BS)
- 插值查找 - Interpolation Search (InterpSearch)
- 斐波那契查找 - Fibonacci Search (FibSearch)
- 哈希查找 - Hash Search (HashSearch)
- 哈希表 - Hash Table (HashTable/HT)
- 哈希函数 - Hash Function (HashFunc)
- 冲突解决 - Collision Resolution (CR)
- 链地址法 - Chaining / Separate Chaining (Chain)
- 开放定址法 - Open Addressing (OA)
- 平衡二叉树 - Balanced Binary Tree / AVL Tree (AVL)
- B树 - B-Tree (BTree)
- B+树 - B+ Tree (BPlusTree)
- B*树 - B* Tree (BStarTree)
- AVL树 - AVL Tree (AVL)
- 红黑树 - Red-Black Tree (RBT)
- 跳表 - Skip List (SkipList)
- 布隆过滤器 - Bloom Filter (BF)
排序 (Sorting)
- 排序 - Sorting (sort)
- 冒泡排序 - Bubble Sort (BubbleSort)
- 选择排序 - Selection Sort (SelectSort)
- 插入排序 - Insertion Sort (InsertSort)
- 希尔排序 - Shell Sort (ShellSort)
- 归并排序 - Merge Sort (MergeSort)
- 快速排序 - Quick Sort (QuickSort/QSort)
- 堆排序 - Heap Sort (HeapSort)
- 计数排序 - Counting Sort (CountSort)
- 基数排序 - Radix Sort (RadixSort)
- 桶排序 - Bucket Sort (BucketSort)
- 内部排序 - Internal Sorting (InternalSort)
- 外部排序 - External Sorting (ExternalSort)
- 稳定排序 - Stable Sorting (StableSort)
- 不稳定排序 - Unstable Sorting (UnstableSort)
- 比较排序 - Comparison Sort (CompSort)
- 非比较排序 - Non-Comparison Sort (NonCompSort)
- 堆 - Heap (heap)
- 最大堆 - Max Heap (MaxHeap)
- 最小堆 - Min Heap (MinHeap)
- 分治法 - Divide and Conquer (D&C)
- 枢轴元素 - Pivot Element (pivot)
- 标题: 数据结构英文术语对照
- 作者: 星隐
- 创建于 : 2025-10-24 17:34:08
- 更新于 : 2026-01-19 01:58:27
- 链接: https://www.starin.top/post/75d7e568e3f3/
- 版权声明: 本文章采用 CC BY-NC-SA 4.0 进行许可。