Heap is a complete binary tree - Data Structure

Q.  Data Structure: A complete binary tree with the property that key value in any node is greater than or equal to the key values in both its children is called as.
- Published on 19 Oct 15

a. Binary search tree
b. Threaded binary tree
c. Heap
d. AVL tree

ANSWER: Heap

Related Content

 

    Discussion

  • Nihal   -Posted on 01 Apr 16
    Heap is a complete binary tree with the property that key value in any node is greater than or equal to the key values in both its children. A common use of a heap is to implement a priority queue.

➨ Post your comment / Share knowledge


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)
▲