Advance Data Structure Quiz-B-1 assesses knowledge on advanced tree structures like R-B Trees and 2-3 Trees, focusing on their properties, manipulations, and theoretical bounds. It's ideal for learners aiming to deepen their understanding of efficient data organization and manipulation.
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.
Rate this question:
(n+1)/2
(n-1)/2
(n/2)-1
(n+1)/2
Rate this question:
Pre-order
Post-order
In-order
None of these
Rate this question:
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.
Rate this question:
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.
Rate this question:
4
5
6
7
Rate this question:
2exp(h-1)-1
2exp(h+1)-1
2exp(h)-1
2exp(h+1)-1
Rate this question:
O(nlg(n))
O(√n)
O(n)
O(lg(n))
Rate this question:
(4,7)
(7,4)
(8,3)
(3,8)
Rate this question:
Binary Tree
Binary Search Tree
Max- heap
Min-Heap
Rate this question:
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
LL
LR
RL
None of these
Rate this question:
Insert
Find
Delete
None of these
Rate this question:
R-B Tree
Binary Search Tree
Binary Tree
2-3 Tree
Rate this question:
Quiz Review Timeline (Updated): Mar 19, 2023 +
Our quizzes are rigorously reviewed, monitored and continuously updated by our expert board to maintain accuracy, relevance, and timeliness.