In what ways is a heap different from a binary tree?
What will be an ideal response?
A heap is a complete binary tree. Binary trees in general do not have to be complete. A heap also has an
ordering applied to the elements stored in the tree, in which the children of an element are larger than or equal to (in the case of
a minheap) or smaller than or equal to (in the case of a maxheap) the parent element. Binary trees may have an order applied to
the elements, for example, a binary search tree, but ordering is not an inherent property of a binary tree.
You might also like to view...
DB-API is an acronym for_________ .
a) Database Application Programming Interface. b) Data Born Application Programming Interface. c) Digital Blueprint for Application Programming Interface. d) None of the above.
You can typically view stock quotes on news web sites, but you need an online broker for investment activities.
Answer the following statement true (T) or false (F)