CS301 Quiz No.3 Shared by Shoaib

Question # 1 of 10 ( Start time: 07:56:35 PM ) Total Marks: 1
If the bottom level of a binary tree is not completely filled, depicts that the tree is not a _______.
Select correct option:
Expression tree
Threaded binary tree
complete binary tree
Perfectly complete binary tree  ok


Question # 2 of 10 ( Start time: 07:57:18 PM ) Total Marks: 1
Suppose we have a Binary Search Tree with levels of node given below tell which one of the following is AVL tree also,
Select correct option:
1,0,0,1,-1,0,2,0,-2
1,0,-1,0,2,0,-2,0,0
1,1,-1,-1,0,-1,0,0,0  ok
1,0,-1,-1,2,0,0,-1,0


Question # 3 of 10 ( Start time: 07:57:58 PM ) Total Marks: 1
A binary tree with 45 internal nodes has _______links to external nodes.
Select correct option:
44
45
46  ok
90


Question # 4 of 10 ( Start time: 07:58:32 PM ) Total Marks: 1
A node in AVL tree can become imblanced due to,
Select correct option:
insertion operation
deletion operation
both insertion and deletion operation
none of the given options


Question # 5 of 10 ( Start time: 07:58:32 PM ) Total Marks: 1
In case of insertion of right inner node in BST,
Select correct option:
we need to apply single left rotation to make it AVL tree.
we need to apply single right rotationto make it AVL tree.
single left rotation first and then single right rotation to make it AVL tree.
single right rotation first and then single left rotation to make it AVL tree.


Question # 6 of 10 ( Start time: 08:03:14 PM ) Total Marks: 1
If the bottom level of a binary tree is NOT completely filled, depicts that the tree is NOT a ----------
Select correct option:
Complete Binary tree
Threaded binary tree
Expression tree
Perfectly complete Binary tree


Question # 7 of 10 ( Start time: 08:04:00 PM ) Total Marks: 1
Consider a binary tree, represented by the following array: A,B,C,D,E,F,G,I Is it a strictly binary tree ?
Select correct option:
Yes
No


Question # 8 of 10 ( Start time: 08:05:08 PM ) Total Marks: 1
Which of the following statement is true about dummy node of threaded binary tree?
Select correct option:
This dummy node never has a value
This dummy node has always some dummy value
This dummy node has either no value or some dummy value.  ok
This dummy node has always some integer value.


Question # 9 of 10 ( Start time: 08:06:10 PM ) Total Marks: 1
The statement "The insertion operation in avl tree, generally take's more time than insertion operation in simple binary search tree" is
Select correct option:
Always correct
Is always incorrect
Can be correct is some cases only
None of these.


Question # 10 of 10 ( Start time: 08:07:13 PM ) Total Marks: 1
When a complete binary tree, represented by an array then for any array element at position i, the parent is at position ______ .
Select correct option:
2i-1
2i
2i+1
floor(i/2)