Data Structure and Algorithm in C++

2 110 points] Fill in the correct answers: is a natural data structure to implement a priority queue. A. B. Using C. In a min-heap, the smallest key is always at the D. The maximum height of a binary tree of N nodes is E. A Heap can be implemented efficiently using a(n) F. A hash table using data structure is usually a faster way of searching for an item. scheme generally uses more storage compared to other schemes. G. A(n)traversal of a binary search tree gives the keys in non-decreasing order. H. The minimum number of nodes in a binary tree of height h is I. The maximum number of nodes in a heap of height h is J. The minimum number of nodes in a binary search tree of height h is