Trees in Data Structures MCQ question and answer with solution | Data Structure MCQs

A. A

B. E

C. D

D. G

A. O(N)

B. O(log N)

C. O(√N+M)

D. O(√N)

A. O(N)

B. O(log N)

C. O(N log N)

D. O(M log N)

A. O (log M!)

B. O (M!)

C. O (M²)

D. O (log (log M))

A. to have efficient insertion

B. to have efficient deletion

C. to have efficient region query

D. to have efficient traversal

A. Unbalanced

B. Balanced

C. Complete

D. Non - Binary

A. O(1)

B. O(n)

C. O(log n)

D. O(n log n)

A. postfix expression

B. infix expression

C. prefix expression

D. invalid expression

A. 1

B. 2

C. 3

D. Both have same number of nodes

A. abcde++**

B. ab+cde+**

C. abc+de+**

D. abcd+*e+*