Register

GATE Overflow | Data Structures | Test 1 | Question: 14

304 views
0 votes
0 votes

Consider the array given below:

20 10 9 8 7 6 5

It is

  1. a full binary tree in array representation
  2. a complete binary tree in array representation
  3. a max-heap in array representation
  4. all of the above
User Avatar

1 Answer

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

Related questions

1 votes
1 votes
1 answer
1
Arjun asked Oct 10, 2016
462 views
GATE Overflow | Data Structures | Test 1 | Question: 12
What is the content of the array after two delete operations on the binary heap 10 5 8 4 3? 5 4 3 5 3 4 10 5 8 8 4 3
What is the content of the array after two delete operations on the binary heap 10 5 8 4 3?5 4 35 3 410 5 88 4 3
User Avatar
1 votes
1 votes
1 answer
2
Arjun asked Oct 10, 2016
245 views
GATE Overflow | Data Structures | Test 1 | Question: 11
Which one of the following array represents a binary max-heap? 20 13 4 11 3 12 2 20 13 4 12 11 3 2 20 13 4 3 2 12 11 20 13 4 12 3 11 2
Which one of the following array represents a binary max-heap?20 13 4 11 3 12 220 13 4 12 11 3 220 13 4 3 2 12 1120 13 4 12 3 11 2
User Avatar
6 votes
6 votes
5 answers
4
Arjun asked Oct 10, 2016
1,145 views
GATE Overflow | Data Structures | Test 1 | Question: 16
A program takes as input a binary tree (not necessarily balanced) with $n$ nodes and computes for each node, the no. of leaf nodes in the sub-tree rooted at that node. The worst case time complexity of the program is $\Theta(n)$ $\Theta(n \log n)$ $\Theta\left(n^2 \right)$ $\Theta\left(n^2 \log n \right)$
A program takes as input a binary tree (not necessarily balanced) with $n$ nodes and computes for each node, the no. of leaf nodes in the sub-tree rooted at that node. Th...
User Avatar
Link Copied!