java堆 数据结构 堆_快速堆数据结构

java堆 数据结构 堆

In this tutorial, we’ll be discussing and implementing Heap data structures in Swift.

在本教程中，我们将在Swift中讨论和实现Heap数据结构。

迅捷堆 (Swift Heap)

Heap can be either a max heap or a min heap.
In a max heap, the root node is the largest element and all the child nodes must be smaller than the parent. Min-heap works just the opposite way.
A heap is a specialized tree-based data structure.
The Heap data structure can be used to efficiently find the kth smallest (or largest) element in an array.

堆可以是最大堆，也可以是最小堆。
在最大堆中，根节点是最大的元素，所有子节点必须小于父节点。 最小堆的工作方式恰恰相反。
堆是一种特殊的基于树的数据结构。
堆数据结构可用于有效地找到数组中第k个最小（或最大）的元素。

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.
如果P是C的父节点，则P的键（值）大于或等于（在最大堆中）或小于或等于（在最小堆中）C。

Nodes at the top are highest priority ones.

顶部的节点是最高优先级的节点。

An illustration of a min heap is: