[computing] In computer programming, a variation on the binary tree data structure in which each node’s value is greater than the value of its leaf nodes. Sorting data in a heap allows an element to be located more quickly than it could be found in an ordinary list.