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

Explore more Topics under Data Structures and Algorithms

01

Data Structures Basics

02

Data Types and Abstraction

03

Algorithm Complexity

04

Arrays and Pointers

05

Linked Lists

06

Stacks and Queues

07

Recursion

08

Graphs

09

String Operations

10

Sorting and Searching

11

Object Oriented Programming

12

Dynamic Programming

Q1.

The following formula is of :

left_subtree (keys) ≤ node (key) ≤ right_subtree (keys)

Bianry Tree

Complete Binary Tree

Binary Search Tree

All of the above

Discuss

Answer: (c).Binary Search Tree

Q2.

Binary search tree has best case run-time complexity of Ο(log n). What could the worst case?

Ο(n)

Ο(n2)

Ο(n3)

None of the above

Discuss

Answer: (a).Ο(n)

Q3.

In order traversal of binary search tree will produce −

unsorted list

reverse of input

sorted list

none of the above

Discuss

Answer: (c).sorted list

Q4.

In binary heap, whenever the root is removed then the rightmost element of last level is replaced by the root. Why?

It is the easiest possible way.

To make sure that it is still complete binary tree.

Because left and right subtree might be missing.

None of the above.

Discuss

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

we'll get a different spanning tree.

we'll get the same spanning tree.

spanning will have less edges.

spanning will not cover all vertices.

Discuss

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 ?

Discuss

Answer: (c).5

Q7.

Which method can find if two vertices x & y have path between them?

Depth First Search

Breadth First Search

Both A & B

None A or B

Discuss

Answer: (c).Both A & B

Q8.

Access time of a binary search tree may go worse in terms of time complexity upto

Ο(n2)

Ο(n log n)

Ο(n)

Ο(1)

Discuss

Answer: (c).Ο(n)

Q9.

Visiting root node after visiting left and right sub-trees is called

In-order Traversal

Pre-order Traversal

Post-order Traveral

None of the above

Discuss

Answer: (c).Post-order Traveral

Q10.

In the deletion operation of max heap, the root is replaced by

next available value in the left sub-tree.

next available value in the right sub-tree.

any random value from the heap.

last element of the last level

Discuss

Answer: (d).last element of the last level

Page 1 of 32

Welcome to the Trees MCQs Page

Trees MCQs | Page 1 of 32

Explore more Topics under Data Structures and Algorithms

Data Structures Basics

Data Types and Abstraction

Algorithm Complexity

Arrays and Pointers

Linked Lists

Stacks and Queues

Recursion

Graphs

String Operations

Sorting and Searching

Object Oriented Programming

Dynamic Programming

Suggested Topics

Compiler Design

UNIX

DBMS

Cloud Computing

Management Information Systems

JavaScript

Embedded Systems

Software Engineering

C Programming