(2) A special type of binary tree in which the value of each node is greater than the values of its leaves. A heap sort algorithm works by first organizing a list of data into a heap.
(2) A special type of binary tree in which the value of each node is greater than the values of its leaves. A heap sort algorithm works by first organizing a list of data into a heap.