Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Programming and Data Structure Tree Almost Complete Binary Tree
Which of the following description(s) is/are true:
A. Red Black Tree - Guarantees worst case of O(log n) time for search, insert & delete.
B. Trie - Used for efficient prefix - based searches.
C. AVL Tree - self balancing binary search tree with stricker balance criteria.
D. B - Tree - Allows efficient search, inert, delete operations in disk based system.
Choose the correct answer from the options given below:
1
A & B only
2
C & D only
3
B only
4
A, B & D only