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 2 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

Q11.

All possible spanning trees of graph G

have same number of edges and vertices.

have same number of edges and but not vertices.

have same number of vertices but not edges.

depends upon algorithm being used.

Discuss

Answer: (a).have same number of edges and vertices.

Q12.

Binary search tree is an example of complete binary tree with special attributes.

BST does not care about complete binary tree properties.

BST takes care of complete binary tree properties.

It depends upon the input.

None of the above.

Discuss

Answer: (a).BST does not care about complete binary tree properties.

Q13.

Maximum number of nodes in a binary tree with height k, where root is height 0, is

2k − 1

2k+1 − 1

2k-1 + 1

2k − 1

Discuss

Answer: (b).2k+1 − 1

Q14.

In a min heap

minimum values are stored.

child nodes have less value than parent nodes.

parent nodes have less value than child nodes.

maximum value is contained by the root node.

Discuss

Answer: (c).parent nodes have less value than child nodes.

Q15.

Re-balancing of AVL tree costs

Ο(1)

Ο(log n)

Ο(n)

Ο(n2)

Discuss

Answer: (b).Ο(log n)

Q16.

A binary search tree whose left subtree and right subtree differ in height by at most 1 unit is called ……

AVL tree

Red-black tree

Lemma tree

None of the above

Discuss

Answer: (a).AVL tree

Q17.

Herder node is used as sentinel in …..

Graphs

Stacks

Binary tree

Queues

Discuss

Answer: (c).Binary tree

Q18.

In the …………….. traversal we process all of a vertex’s descendants before we move to an adjacent vertex.

Depth First

Breadth First

Width First

Depth Limited

Discuss

Answer: (a).Depth First

Q19.

The property of binary tree is

The first subset is called left subtree

The second subtree is called right subtree

The root cannot contain NULL

The right subtree can be empty

Discuss

Answer: (d).The right subtree can be empty

Q20.

State true or false.

i) The degree of root node is always zero.

ii) Nodes that are not root and not leaf are called as internal nodes.

True, True

True, False

False, True

False, False

Discuss

Answer: (c).False, True

Page 2 of 32

Welcome to the Trees MCQs Page

Trees MCQs | Page 2 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

Python

Software Engineering

MS Office

MATLAB

JavaScript

CSS

MongoDB

SQL Server

C Programming