What are the two main differences between a heap and a binary search tree?

What will be an ideal response?


First, while a binary search tree can be viewed as being sorted, a heap is ordered in a much weaker sense. Second, while binary search trees come in many different shapes, heaps are always complete binary trees.

Computer Science & Information Technology

You might also like to view...

Once there is no handle to an object, a Java component called the ____ reclaims it, so that its memory can be reused by other objects.

A. Java Virtual Machine (JVM) B. compiler C. garbage collector D. interpreter

Computer Science & Information Technology

As a _________-based service, Microsoft Intune requires the use of two administrative websites.

Fill in the blank(s) with the appropriate word(s).

Computer Science & Information Technology

Cell ____________________ refers to the space between the cell contents and the cell border.

Fill in the blank(s) with the appropriate word(s).

Computer Science & Information Technology

The worksheets that contain the details of the information summarized on a summary sheetare called:

a. summary sheets b. detail sheets c. master worksheets

Computer Science & Information Technology