Editor">
Editor Staff asked 5 months ago
Editor Staff asked 5 months ago
Which of the following is a self – balancing binary search tree?
(a) 2-3 tree
(b) Threaded binary tree
(c) AA tree
(d) Treap
Question is from Binary Trees in portion Binary Trees of Data Structures & Algorithms I
The question was posed to me during an online exam.
1 Answers
Editor">Editor Staff answered 5 months ago
Editor Staff answered 5 months ago
Right option is (c) AA tree
Easiest explanation – An AA tree, which is a variation of red-black tree, is a self – balancing binary search tree. 2-3 is B-tree of order 3 and Treat is a randomized binary search tree. A threaded binary tree is not a balanced tree.
