PAT常见英文

ASCII码

A-65 a-97

---

heap 堆: a specialized tree-based data structure that satisfies the heap property: if P is a parent node of C, then the key (the value) of P is either greater than or equal to (in a max heap) or less than or equal to (in a min heap) the key of C.

Max Heap 大顶堆:a specialized tree-based data structure that satisfies the heap property: if P is a parent node of C, then the key (the value) of P is either greater than or equal to the key of C.父结点的键值一定比子结点的键值大。

Min Heap 小顶堆:a specialized tree-based data structure that satisfies the heap property: if P is a parent node of C, then the key (the value) of P is either less than or equal to the key of C.父结点的键值一定比子结点的键值小。

binary heap 二分堆:a complete binary tree.一棵完全二叉树。

data structure 数据结构

(complete) binary tree （完全）二叉树

graph 图

vertex （图的）顶点

edge （图的）边

vertex coloring 顶点着色:the graph's vertices with colors such that no two vertices sharing the same edge have the same color.图的任意两相邻顶点不能着相同颜色。

k-coloring k着色:用k种颜色进行图的顶点着色使任意两相邻顶点不能着相同颜色。

polynomial 多项式

exponent 指数

coefficient 系数

be accurate to 1 decimal place 保留一位小数

indices 索引（index的复数形式）

10-digit 10位的

prime number 素数

composite number 合数

odd number 奇数

even number 偶数

topological order 拓扑次序（拓扑排序的结果）

clique 团:a subset of vertices of an undirected graph such that every two distinct vertices in the clique are adjacent.满足任意两个顶点都直接相连的顶点子集。

maximal clique 最大团:a clique that cannot be extended by including one more adjacent vertex.满足任意两个顶点都直接相连的最大顶点子集（再多添加一个顶点就不能构成团）。

postorder traversal 后序遍历

preorder traversal 先序遍历

inorder traversal 中序遍历

subset 子集

palindrome 回文（正反读都一样）

quadratic probing 平方探测（一种构建哈希表的算法）

radix 数制

positive integer 正整数

segment 分割

rope 绳子
 

---

decimal  十进制的

binary 二进制的

digits 数位

Radix 进制