Advance Data Structure Quiz-1
R-B Tree
Binary Search Tree
Binary Tree
2-3 Tree
A 2-3 Tree may have root node with only one child
Maximum number of children of any node is 3
A leave can hight either 2 or 3 in a 2-3 tree
Minimum number of children of any node is 2.
Both trees will be same in all cases
Both will be different in all the cases
Both trees may be same or different depending on the case.
Both trees will be same in all cases
Both will be different in all the cases
Both trees may be same or different depending on the case.
2exp(h-1)-1
2exp(h+1)-1
2exp(h)-1
2exp(h+1)-1
2-3 tree
Binary search Tree
Binomial Heap
Fibonacci Heap
Insert
Find
Delete
None of these
(n+1)/2
(n-1)/2
(n/2)-1
(n+1)/2
O(nlg(n))
O(√n)
O(n)
O(lg(n))
Binary Tree
Binary Search Tree
Max- heap
Min-Heap
LL
LR
RL
None of these
4
5
6
7
Pre-order
Post-order
In-order
None of these
925, 202, 911, 240, 912, 245, 258, 363
924, 220, 911, 244, 898, 258, 362, 363
925, 202, 911, 240, 912, 245, 258, 363
2, 399, 387, 219, 266, 382, 381, 278, 363
(4,7)
(7,4)
(8,3)
(3,8)