Question # 1 of 10 ( Start time: 10:58:39 AM ) 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 # 2 of 10 ( Start time: 10:59:08 AM ) Total Marks: 1
In threaded binary tree, the NULL pointers are replaced by the
Select correct option:
preorder successor or predecessor
inorder successor or predecessor
postorder successor or predecessor
NULL pointers are not replaced
Question # 3 of 10 ( Start time: 10:59:34 AM ) Total Marks: 1
Which of the following heap method increase the value of key at position ‘p’ by the amount ‘delta’?
Select correct option:
increaseKey(p,delta)
decreaseKey(p,delta)
preculateDown(p,delta)
remove(p,delta)
Question # 4 of 10 ( Start time: 11:00:47 AM ) Total Marks: 1
If a tree has 20 edges/links, then the total number of nodes in the tree will be :
Select correct option:
19
20
21
Can't be determined
Question # 5 of 10 ( Start time: 11:01:54 AM ) Total Marks: 1
For a perfect binary tree of height h, having N nodes, the sum of heights of nodes is _____________.
Select correct option:
N – (h – 1)
N – (h + 1)
N – 1
N – 1 + h
Question # 6 of 10 ( Start time: 11:02:51 AM ) Total Marks: 1
We can build a heap in _____ time.
Select correct option:
Linear
Exponential
Polynomial
None of the given options
Question # 7 of 10 ( Start time: 11:03:11 AM ) Total Marks: 1
Consider a min heap, represented by the following array: 3,4,6,7,5 After calling the function deleteMin().Which of the following is the updated min heap?
Select correct option:
4,6,7,5
6,7,5,4
4,5,6,7
4,6,5,7,
Question #8 of 10 ( Start time: 11:04:28 AM ) Total Marks: 1
Which of the following is a correct statement?
Select correct option:
An AVL tree is identical to a BST except height of the left and right subtrees can differ by at most 1.
An AVL tree is identical to a BST except height of the left and right subtrees can differ by at least 1.
An AVL tree is identical to a BST except height of the left and right subtrees must differ by at least 1.
An AVL tree is not
Question # 9 of 10 ( Start time: 11:05:30 AM ) Total Marks: 1
A parse tree should be a/an ,
Select correct option:
AVL tree
Heap
Binary Search Tree
Complete Binary Search Tree
Question # 10 of 10 ( Start time: 11:06:57 AM ) Total Marks: 1
If a node is inserted in outer side of a node in binary search tree then to make it AVL tree,
Select correct option:
we may have to apply single rotation
we may have to apply double rotation
We can use any one of single and double rotation.
None of the options.
