Which of the following is a self balancing binary search tree? – McqOptions

MCQOPTIONS

1.	Which of the following is a self balancing binary search tree?
A.	2-3 tree
B.	Threaded binary tree
C.	AA tree
D.	Treap
Answer» D. Treap

Discussion

No Comment Found

Related MCQs

In which of the following self balancing binary search tree the recently accessed element can be accessed quickly?
A self balancing binary search tree can be used to implement ________
Which of the following is a self balancing binary search tree?
Self balancing binary search trees have a much better average-case time complexity than hash tables.
An AVL tree is a self balancing binary search tree, in which the heights of the two child sub trees of any node differ by _________
The binary tree sort implemented using a self balancing binary search tree takes ______ time is worst case.