Data Structure and Algorithm in C++ 2 110 points] Fill in the correct answers: i

Question

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

Explanation / Answer

A- Queue is a natural data structure to implement priority queue.
B-Using Heap data structure is usually a faster way of searching an for an item.
C-In min-heap the smallest key is always at the Root of the tree.
D-The maximum height of a binary tree of N nodes is N-1
E- A heap can be implemented efficiently using an Array
F-
G-A preorder traversal of a binary search tree gives they keys in non-Decreasing order.
H-The maximum number of nodes in a binary tree of height h is 2h-1
I-The maximum number of nodes in a heap of height h is 2(h+1)-1
J-The minimum number of nodes in a binary search tree of height h is 2h+1

Related Questions

Navigate

• Browse (All)
• Browse D
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.