# Welcome to the Trees MCQs Page

Dive deep into the fascinating world of Trees with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Trees, a crucial aspect of Data Structures and Algorithms. In this section, you will encounter a diverse range of MCQs that cover various aspects of Trees, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within Data Structures and Algorithms.

Check out the MCQs below to embark on an enriching journey through Trees. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of Data Structures and Algorithms.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Trees. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

### Trees MCQs | Page 1 of 32

Q1.
The following formula is of :

left_subtree (keys) ≤ node (key) ≤ right_subtree (keys)
Q2.
Binary search tree has best case run-time complexity of Ο(log n). What could the worst case?
Q3.
In order traversal of binary search tree will produce −
Q4.
In binary heap, whenever the root is removed then the rightmost element of last level is replaced by the root. Why?
Answer: (b).To make sure that it is still complete binary tree.
Q5.
If we choose Prim's Algorithm for uniquely weighted spanning tree instead of Kruskal's Algorithm, then
Answer: (b).we'll get the same spanning tree.
Q6.
The number of binary trees with 3 nodes which when traversed in post order gives the sequence A,B,C is ?

a.

3

b.

4

c.

5

d.

6

Q7.
Which method can find if two vertices x & y have path between them?
Q8.
Access time of a binary search tree may go worse in terms of time complexity upto