Register

GATE Overflow Test Series | Data Structures | Test 1 | Question: 17

112 views
1 votes
1 votes
Given an array of elements $5,7,9,1,3,10,8,4,$ which of the following is not a possible array implementation of min-heap of these elements?
  1. $1,3,4,7,5,8,9,10$
  2. $1,4,3,8,9,5,7,10$
  3. $1,3,4,5,8,7,9,10$
  4. All are min-heaps
User Avatar

1 Answer

2 votes
2 votes
By making a complete binary tree of the given choices we can see that all are min-heaps.
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
gatecse asked Aug 9, 2020
309 views
GATE Overflow Test Series | Data Structures | Test 1 | Question: 9
What is the location of parent node for any arbitrary node $i$ in an array implementation of a complete binary tree in C language? floor$(i /2)$ floor$(i+1) /2$ floor$((i-1)/2)$ ceil$((i-1)/2)$
What is the location of parent node for any arbitrary node $i$ in an array implementation of a complete binary tree in C language?floor$(i /2)$floor$(i+1) /2$floor$((i-1)...
User Avatar
3 votes
3 votes
1 answer
3
gatecse asked Aug 9, 2020
227 views
GATE Overflow Test Series | Data Structures | Test 1 | Question: 1
The cut vertices in the given graph are E and F A, C and D C, E and F B and C
The cut vertices in the given graph areE and FA, C and DC, E and FB and C
User Avatar
1 votes
1 votes
1 answer
4
gatecse asked Aug 9, 2020
360 views
GATE Overflow Test Series | Data Structures | Test 1 | Question: 2
Kevin is asked to write a single program to print the inorder, preorder, postorder and level order traversal of a binary tree having $n$ nodes. The best possible time complexity of this function is ___________ $\Theta(n^3)$ $\Theta(n)$ $\Theta(n^2)$ $\Theta(n\log n)$
Kevin is asked to write a single program to print the inorder, preorder, postorder and level order traversal of a binary tree having $n$ nodes. The best possible time com...
User Avatar
Link Copied!