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

A. Red - Black Tree

B. Red - Brown Tree

C. Red - Yellow Tree

D. Red - Tango Tree

A. true

B. false

A. O (log n)

B. O (n²)

C. O (n!)

D. O (log (log n))

A. difficulty in knowing children nodes of a node

B. difficult in finding the parent of a node

C. have to know the maximum number of nodes possible before creation of trees

D. difficult to implement

A. It traverses in a non increasing order

B. It traverses in an increasing order

C. It traverses in a random fashion

D. It traverses based on priority of the node

A. Height

B. Depth

C. Length

D. Width

A. 7, 8, 26, 13, 75, 40, 70, 35

B. 26, 13, 7, 8, 70, 75, 40, 35

C. 7, 8, 13, 26, 35, 40, 70, 75

D. 8, 7, 26, 13, 40, 75, 70, 35

A. Level-order traversal

B. Pre-order traversal

C. Post-order traversal

D. In-order traversal

A. 2^l-1

B. l-1

C. l

D. 2l

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

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

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

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