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

Home / Data Structure / Trees In Data Structures

Section 1 Section 2

71.
Which of the following is the simplest data structure that supports range searching?

A. Heaps

B. binary search trees

C. AA-trees

D. K-d trees

Answer & Solution Discuss in Board Save for Later

72.
Which node is the Leaf node in the following ternary tree?

A. A

B. B

C. D

D. G

Answer & Solution Discuss in Board Save for Later

73.
Which tree traversal technique is used to evaluate the expression represented by syntax tree?

A. Pre-order traversal

B. In-order traversal

C. Post-order traversal

D. Breadth first traversal

Answer & Solution Discuss in Board Save for Later

1 2 3 4 5 6 7 8

Read More Section(Trees in Data Structures)

Each Section contains maximum 100 MCQs question on Trees in Data Structures. To get more questions visit other sections.

Trees in Data Structures - Section 1