How to determine the heap sequence

We know a sequence, such as {100,6070,50,32,65}, how to determine whether it is a heap?

Answer: Treat this sequence as an array-type binary tree. If the root node is i, the left subtree is 2*i, and the right subtree is 2*i 1.

Heap is divided into maximum heap and minimum heap.

1. All parent nodes in the maximum heap are larger than the left subtree and right subtree. For example, if a known sequence is drawn as a heap:

So the known sequence is a maximum heap.

2. All parent nodes in the minimum heap are smaller than the left subtree and right subtree, such as {32,50,60,70,100,65}, drawn as a heap:

The sequence that meets the above two situations is the heap

The above is the detailed content of How to determine the heap sequence. For more information, please follow other related articles on the PHP Chinese website!