Algorithms Searching, Sorting and Hashing Sorting

which of the following is correct ?      

1
A heap is always a binary search trees.
2
A binary search tree is always a heap.
3
A heap is always a complete binary tree
4
A complete binary tree is always a heap.

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters