50+ Self Balancing Binary Search Tree MCQs with FREE PDF

We have the best collection of Self Balancing Binary Search Tree MCQs and answer with FREE PDF. These Self Balancing Binary Search Tree MCQs will help you to prepare for any competitive exams like: BCA, MCA, GATE, GRE, IES, PSC, UGC NET, DOEACC Exams at all levels – you just have to practice regularly.

Self Balancing Binary Search Tree MCQs

1. Associative arrays can be implemented using __________

a) B-tree

b) A doubly linked list

c) A single linked list

d) A self balancing binary search tree

Answer: d

2. The minimum height of self balancing binary search tree with n nodes is

a) log2(n)

b) n

c) 2n + 1

d) 2n – 1

Answer: a

3. Which of the following is not the self balancing binary search tree?

a) AVL Tree

b) 2-3-4 Tree

c) Red – Black Tree

d) Splay Tree

Answer: b

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

a) O(n log n)

b) O(n)

c) O(n2)

d) O(log n)

Answer: a

5. 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 _________

a) At least one

b) At most one

c) Two

d) At most two

Answer: b

6. Binary tree sort implemented using a self balancing binary search tree takes O(n log n) time in the worst case but still it is slower than merge sort.

a) True

b) False

Answer: a

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

a) True

b) False

Answer: b

8. 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: c

9. A self – balancing binary search tree can be used to implement ________

a) Priority queue

b) Hash table

c) Heap sort

d) Priority queue and Heap sort

Answer: a

10. In which of the following self – balancing binary search tree the recently accessed element can be accessed quickly?

a) AVL tree

b) AA tree

c) Splay tree

d) Red – Black tree

Answer: c

Self Balancing Binary Search Tree MCQs PDF Download

50+ Binary Trees using Array MCQs with FREE PDF
50+ Binary Trees using Linked Lists MCQs with FREE PDF
50+ Binary Tree Operations MCQs with FREE PDF
50+ Preorder Traversal MCQs with FREE PDF
50+ Postorder Traversal MCQs with FREE PDF
50+ Inorder Traversal MCQs with FREE PDF
50+ Binary Tree Properties MCQs with FREE PDF
50+ Binary Search Tree MCQs with FREE PDF
50+ Balanced Binary Tree MCQs with FREE PDF
50+ Randomized Binary Search Tree MCQs with FREE PDF
50+ AA Tree MCQs with FREE PDF
50+ AVL Tree MCQs with FREE PDF
50+ Cartesian Tree MCQs with FREE PDF
50+ Weight Balanced Tree MCQs with FREE PDF
50+ Red Black Tree MCQs with FREE PDF
50+ Top Tree MCQs with FREE PDF
50+ Splay Tree MCQs with FREE PDF
50+ Treap MCQs with FREE PDF
50+ Threaded Binary Tree MCQs with FREE PDF
50+ Tango Tree MCQs with FREE PDF
50+ Rope MCQs with FREE PDF