1. heap
2. Heap (data structure)In computer science, a heap is a specialized tree-based data structure that satisfies the heap property: if B is a child node of A, then key(A) ≥ key(B). This implies that an element with the greatest key is always in the root node, and so such a heap is sometimes called a max-heap. (Alternatively, if the comparison is reversed, the smallest element is always in the root node, which results in a min-heap.
Read “Heap (data structure)” on English Wikipedia
Read “ヒープ” on Japanese Wikipedia
Read “Heap (data structure)” on DBpedia
Read “Heap (data structure)” on English Wikipedia
Read “ヒープ” on Japanese Wikipedia
Read “Heap (data structure)” on DBpedia
Discussions
Log in to talk about this word.