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 繩子
歡迎大家關注/訂閱我的微信公衆號Code Art Online，我會在我的公衆號分享個人見聞，發現生活趣味；這裏不僅有0和1，還有是詩和遠方↓↓↓
