A heap data structure is a binary tree where the value of each node is greater than or equal to the values of its children.