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

A. A

B. C

C. G

D. H

A. N

B. N/2

C. N/2^r

D. N^r

A. 0

B. 1

C. 2

D. 3

A. 1

B. 2

C. 3

D. 0

A. Union by rank

B. Equivalence function

C. Dynamic function

D. Path compression

A. O(N)

B. O(log N)

C. O(N log N)

D. O(M log N)

A. partial queries

B. range queries

C. neighbour queries

D. search queries

A. Peter Van Emde Boas

B. Samuel F. B. Morse

C. Friedrich Clemens Gerke

D. Alexander Morse

A. n parse tree = n leftmost derivation tree = n rightmost derivation tree

B. n parse tree = n leftmost derivation tree

C. n parse tree = n rightmost derivation tree

D. n parse tree = n non-terminals

A. Static code analyzing

B. Implement indexing in databases

C. Used for dynamic memory allocation

D. To represent networks of communication