NEW
Font size
Worksheets31st
Total questions: 10
Worksheet time: 5mins
What is the maximum height of any AVL-tree with 7 nodes? Assume that the height of a tree with a single node is 0.
2
3
4
5
The sequence of insertion 10,12,14 will lead to imbalance by using which rotation can be used to balance the tree
RR rotation
LL rotation
LR rotation
RL rotation
The sequence of insertion 25,12,9 will lead to imbalance by using which rotation can be used to balance the tree
RR rotation
LL rotation
RL rotation
LR rotation
AVL trees are used when you have
a) Huge number of searching operations
b) fewer insertion and deletion operation
c) you want guaranteed search time of O(log n)
d) all options are correct
The sequence of insertion 25,12,18 will lead to imbalance by using which rotation can be used to balance the tree
LL followed by RR
RR followed by LL
LL followed by LL
RR followed by RR
_____________is the method used by card sorter?
Radix sort
Insertion
Heap
Quick
How many possible solutions exist for an 8-queen problem?
100
98
92
88
In n-queen problem, how many values of n does not provide an optimal solution?
1
2
3
4
Insertion
Merge
Bubble
Selection
