# 100+ B-Trees MCQs with FREE PDF

This B-Trees MCQs contains the MCQs on b tree, b+ tree and 2-3 tree. We have the best collection of B-Trees MCQs and answer with FREE PDF. These B-Trees 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.

## B-Trees MCQs

#### 1. Which of the following data structure can provide efficient searching of the elements?

a) unordered lists

b) binary search tree

c) treap

d) 2-3 tree

a) True

b) False

#### 3. The height of 2-3 tree with n elements is ______

a) between (n/2) and (n/3)

b) (n/6)

c) between (n) and log2(n + 1)

d) between log3(n + 1) and log2(n + 1)

Answer: between log3(n + 1) and log2(n + 1)

#### 4. Which of the following is not true about the 2-3 tree?

a) all leaves are at the same level

b) it is perfectly balanced

c) postorder traversal yields elements in sorted order

d) it is B-tree of order 3

Answer: postorder traversal yields elements in sorted order

#### 5. AVL trees provide better insertion the 2-3 trees.

a) True

b) False

Top 2-3 Tree MCQs with FREE PDF

a) 4

b) 6

c) 5

d) 3

a) Brother

b) Sister

c) Mother

d) Parent

a) 2

b) 1

c) 0

d) 3

#### 9. How many extra nodes are there in Full ternary tree than a complete ternary tree?

a) 1

b) 2

c) 3

d) Both have same number of nodes

Answer: Both have same number of nodes

a) True

b) False

a) True

b) False

#### 12. Which of the following is the implementation of the ternary tree?

a) AVL Tree

b) Ternary Heap

c) Hash Table

d) Dictionary

Top B+ Tree MCQs with FREE PDF

a) 255

b) 63

c) 127

d) 188

a) True

b) False

a) AVL

b) AA

c) 2-3

d) Red-Black

#### 16. B-tree of order n is a order-n multiway tree in which each non-root node contains __________

a) at most (n – 1)/2 keys

b) exact (n – 1)/2 keys

c) at least 2n keys

d) at least (n – 1)/2 keys

Answer: at least (n – 1)/2 keys

#### 17. What is the best case height of a B-tree of order n and which has k keys?

a) logn (k+1) – 1

b) nk

c) logk (n+1) – 1

d) klogn

Answer: logn (k+1) – 1

a) True

b) False

#### 19. Which of the following is the most widely used external memory data structure?

a) AVL tree

b) B-tree

c) Red-black tree

d) Both AVL tree and Red-black tree

#### 20. Which of the following is true?

a) larger the order of B-tree, less frequently the split occurs

b) larger the order of B-tree, more frequently the split occurs

c) smaller the order of B-tree, more frequently the split occurs

d) smaller the order of B-tree, less frequently the split occurs

Answer: larger the order of B-tree, less frequently the split occurs

Top B-Tree MCQs with FREE PDF