PAT(Advanced Level)中常见的专业英语

五角场的夜风

于 2020-01-25 13:46:51 发布

阅读量1.1k

点赞数 2

分类专栏：算法技巧文章标签：专业词汇 PAT 数据结构算法二叉树

本文链接：https://blog.csdn.net/weixin_41676881/article/details/100070554

版权

本文介绍了PAT高级水平考试中常见的专业英语词汇，涉及数据结构如堆（Max Heap, Min Heap, 二分堆）、图（顶点、边、顶点着色）、算法（拓扑排序、哈希表构建）等概念，帮助读者理解并掌握相关专业术语。" 120536936,7387359,C/C++中的内联函数理解与应用,"['C++', 'C语言', 'inline', '函数优化']

摘要由CSDN通过智能技术生成

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 sh