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

A. O(1)

B. O(m)

C. O(m²)

D. O(log m)

A. O(1)

B. O(n)

C. O(log n)

D. O(n log n)

A. the two cities should have a one-way connection

B. the two cities should have a two-way connection

C. the two cities should be in different countries

D. no equivalence relation will exist between two cities

A. true

B. false

A. True

B. False

A. True

B. False

A. A

B. C

C. B

D. No child node

A. A

B. C

C. B

D. No child node

A. Pre-order traversal

B. In-order traversal

C. Post-order traversal

D. Breadth-first traversal

A. A(1,i) = i+1 for i>=1

B. A(i,j) = i+j for i>=j

C. A(i,j) = i+j for i = j

D. A(1,i) = i+1 for i<1