JAVA DATA STRUCTURES

Please answer the following:

1.) To represent a heap in an array, place the result of a(n) _____ traversal into consecutive array locations beginning at index 1.

level order

inorder

preorder

postorder

2.) A heap is a complete binary tree whose nodes contain _____ objects.

equal

Comparable

generic

similar

3.) When adding an entry to a binary search tree, when does the search ends?

when the item is found

at a leaf if the entry is not already in the tree

both a & b

none of the above