Self Balancing Binary Search Tree Quiz Online Practice Test

1. Which of the following is not considered a self-balancing binary search tree?

AVL Tree

2-3-4 Tree

Red-Black Tree

Splay Tree

2. The binary tree sort implemented using a self – balancing binary search tree takes ______ time is worst case.

O(n log n)

O(n)

O(n2)

O(log n)

3. An AVL tree is a self-balancing binary search tree where the heights of the two child subtrees of any node differ by:

At least one

At most one

Two

At most two

4. Associative arrays can be efficiently realized with:

B-tree

Doubly linked list

Singly linked list

Self-balancing binary search tree

5. Self-balancing binary search trees have a much better average-case time complexity than hash tables.

True

False

Only for search operations

Only for insertion and deletion operations

6. Which of these is classified as a self-balancing binary search tree?

2-3 tree

Threaded binary tree

AA tree

Treap

7. A self-balancing binary search tree is suitable for implementing:

Priority queue

Hash table

Heap sort

Both priority queue and heap sort

8. In which of the following self-balancing binary search trees can recently accessed elements be retrieved more quickly?

AVL tree

AA tree

Splay tree

Red-Black tree

9. The smallest possible height of a self-balancing binary search tree with ( n ) nodes is:

log 2(n)

( n )

( 2n + 1 )

( 2n - 1 )

10. Binary tree sort using a self-balancing binary search tree has a worst-case time complexity of O(n log n) but is slower than merge sort.

True

False

Only for certain data distributions

Only in average cases

Test Name:	Self Balancing Binary Search Tree Quiz
Subject Category:	Computer Science
Test Type:	Multiple Choice Questions
Total Score / Questions:	10 / 10
Time Allowed:	10 Min
Who Should Practice this Test:	Students, job seekers, or professionals preparing for competitive exams and interviews.

Self Balancing Binary Search Tree MCQ Quiz Online Practice Test