Register

Test by Bikram | Mock GATE | Test 3 | Question: 3

• retagged by
289 views
0 votes
0 votes

What feature of heaps allows them to be efficiently implemented using a partially filled array?

  1. Heaps are binary search trees.
  2. Heaps contain only integer data.
  3. Heaps are full binary trees.
  4. Heaps are complete binary trees.
• retagged by
User Avatar

1 Answer

Best answer
3 votes
3 votes

A heap is a complete binary tree; that is, all levels of the tree, except possibly the last level (deepest) are fully filled , if the last level of the tree is not complete, the nodes of that level are filled from left to right. 

This property of a heap allows them to be efficiently implemented using a partially filled array .

Hence the option is D .

User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
Bikram asked Feb 9, 2017
229 views
Test by Bikram | Mock GATE | Test 3 | Question: 47
A binary max-heap is implemented using an array $A$. The contents of $A$ is $\left \{90, 70, 75, 15, 45, 40, 60 \right \}$. The contents of $A\left[3 \right ]$ are increased from $15$ to $100$. What will the contents of $A$ ... $\left \{ 100, 90, 75, 70, 45, 60, 40 \right \}$
A binary max-heap is implemented using an array $A$. The contents of $A$ is $\left \{90, 70, 75, 15, 45, 40, 60 \right \}$. The contents of $A\left[3 \right ]$ are increa...
User Avatar
1 votes
1 votes
2 answers
2
Bikram asked Feb 9, 2017
319 views
Test by Bikram | Mock GATE | Test 3 | Question: 21
A ternary tree is a tree in which every internal node has exactly three children. The number of leaves in a ternary tree with $’z’$ internal nodes is _______. $2$\left ( z+1 \right )$+ 3$ $2z$ $3z$ $2z + 1$
A ternary tree is a tree in which every internal node has exactly three children.The number of leaves in a ternary tree with $’z’$ internal nodes is _______.$2$$\left...
User Avatar
0 votes
0 votes
1 answer
4
Bikram asked Feb 9, 2017
252 views
Test by Bikram | Mock GATE | Test 3 | Question: 9
A complete binary tree can be stored in an array. If index starts at $1$, to access the child of $i^{th}$ node, the _____$^{th}$ and _____ $^{th}$ index of array needs to be used. $2i - $ and $2i$ $2i$ and $2i + 1$ $2i + 1$ and $2i + 2$ $2i - 1$ and $2i + 1$
A complete binary tree can be stored in an array.If index starts at $1$, to access the child of $i^{th}$ node, the _____$^{th}$ and _____ $^{th}$ index of array needs t...
User Avatar
Link Copied!