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

A. O(N)

B. O(√N)

C. O(N²)

D. O(log N)

A. O (n²)

B. O (n!)

C. O (log n)

D. O (1)

A. B-tree

B. A doubly linked list

C. A single linked list

D. A self balancing binary search tree

A. all basic operations and set intersection, set union and subset test

B. all basic operations

C. set intersection, set union and subset test

D. only insertion and deletion

A. The left child is always lesser than its parent

B. The right child is always greater than its parent

C. The left and right sub-trees should also be binary search trees

D. In order sequence gives decreasing order of elements

A. (-1, 0)

B. (1, 0)

C. (0, 5)

D. (0, 1)

A. log2 n

B. log4/3 n

C. log3 n

D. log3/2 n

A. O (n)

B. O (n²)

C. O (log n)

D. O (n!)

A. 0

B. 1

C. 2

D. 3

A. 2i+1

B. 2i+2

C. 2i

D. 4i