Ternary Heap Test

1. Heap exhibits the property of a binary tree?

2. The worst case complexity of deleting any arbitrary node value element from heap is __________

3. What is the complexity of adding an element to the heap.

4. If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.

5. If we implement heap as maximum heap , adding a new node of value 15 to the left most node of right subtree. What value will be at leaf nodes of the right subtree of the heap.

6. In a max-heap, element with the greatest key is always in the which node?

7. Heap can be used as ________________

8. An array consists of n elements. We want to create a heap using the elements. The time complexity of building a heap will be in order of