Binary Search Trees(B Tree) MCQ question and answer with solution | Data Structure MCQs

A. insertion takes less time

B. deletion takes less time

C. searching takes less time

D. construction of the tree takes less time than binary heap

A. Only right children can be red

B. Only left children can be red

C. Right children should strictly be black

D. There should be no left children

A. using least significant bit of one of the pointers in the node for color information

B. using another array with colors of each node

C. storing color information in the node structure

D. using negative and positive numbering

A. Let T be a binary tree. For every k ≥ 0, there are no more than 2k nodes in level k

B. Let T be a binary tree with λ levels. Then T has no more than 2^{λ – 1} nodes

C. Let T be a binary tree with N nodes. Then the number of levels is at least ceil(log (N + 1))

D. Let T be a binary tree with N nodes. Then the number of levels is at least floor(log (N + 1))

A. root node

B. leaf node

C. null node

D. centre node

A. k+2 O (log (log n))

B. k+1 O (log n)

C. K+2 O (log n)

D. k+1 O (log (log n))

A. false

B. true

A. At least one

B. At most one

C. Two

D. At most two

A. Unbalanced

B. Balanced

C. Complete

D. Full

A. 6, 2, 5, 7, 11, 2, 5, 9, 4

B. 6, 5, 2, 11, 7, 4, 9, 5, 2

C. 2, 7, 2, 6, 5, 11, 5, 9, 4

D. 2, 7, 6, 5, 11, 2, 9, 5, 4