Question # 1 of 10 ( Start time: 11:08:20 AM ) Total Marks: 1
A complete binary tree is a tree that is _________ filled, with the possible exception of the bottom level.
Select correct option:
partially
completely (Page No. 326)
incompletely
partly
Question # 2 of 10 ( Start time: 11:08:47 AM ) Total Marks: 1
If one pointer of the node in a binary tree is NULL then it will be a/an
Select correct option:
Inner node
Leaf node
External node
Root node
Question # 3 of 10 ( Start time: 11:10:08 AM ) Total Marks: 1
In case of insertion of left outer node in BST,
Select correct option:
we apply single right rotation to make it AVL Tree.
we apply single left rotation to make it AVL Tree.
we first apply right rotation and then left rotation to make it AVL Tree.
we first apply left rotation and then right rotation to make it AVL Tree.
Question # 4 of 10 ( Start time: 11:10:48 AM ) Total Marks: 1
For a perfect binary tree of height 4. What will be the sum of heights of nodes?
Select correct option:
31
30
27
26
Question # 5 of 10 ( Start time: 11:11:32 AM ) Total Marks: 1
Consider a min heap, represented by the following array: 10,30,20,70,40,50,80,60 After inserting a node with value 31.Which of the following is the updated min heap?
Select correct option:
10,30,20,31,40,50,80,60,70
10,30,20,70,40,50,80,60,31
10,31,20,30,40,50,80,60,31
31,10,30,20,70,40,50,80,60
Question # 6 of 10 ( Start time: 11:12:56 AM ) Total Marks: 1
A tree is an AVL tree if
Select correct option:
Any one node fulfills the AVL condition
At least half of the nodes fulfill the AVL condition
All the nodes fulfill the AVL condition
None of the given options
Question # 7 of 10 ( Start time: 11:13:38 AM ) Total Marks: 1
Consider a min heap, represented by the following array: 3,4,6,7,5,10 After inserting a node with value 1. Which of the following is the updated min heap?
Select correct option:
3,4,6,7,5,10,1
3,4,6,7,5,1,10
1,4,6,7,5,10,3
1,4,3,7,5,10,6
Question # 8 of 10 ( Start time: 11:14:38 AM ) Total Marks: 1
If the height of a perfect binary tree is 4. What will be the total number of nodes in it?
Select correct option:
15
16
31
32
Question # 9 of 10 ( Start time: 11:15:57 AM ) Total Marks: 1
Which of the following statement concerning heaps is NOT true?
Select correct option:
A heap can be stored in a binary search tree.
A heap can be stored in an array.
A heap can be used to implement a priority queue.
A heap can be used to sort data.
Question # 10 of 10 ( Start time: 11:16:39 AM ) Total Marks: 1
Consider a binary tree, represented by the following array: A,B,C,D,E,F,G,H,I,J,K,L Is it a strictly binary tree?
Select correct option:
Yes
No
