Question

A____ stores its smallest element at the root of the binary tree.

Answer 1

NOTE: If you are stuck somewhere feel free to ask in the comments section but do not give negative rating to the question as it affects my answering rights......I will try to help you out

ans= Minimum Heap Binary Tree

FACT: A minimum binary heap has following properties

1--In a Min Binary Heap, the key at root must be minimum among all keys present in Binary Heap.

2--All levels of the binary tree are completely filled except possibly the last level and the last level has all keys as left as possible which means it is a complete binary tree

eg:

            10                      10
         /      \               /       \  
       20        100          15         30  
      /                      /  \        /  \
    30                     40    50    100   40