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

Q81.

Trees are often used in implementing _________ and hence it is considered as prime application of trees.

Chess

Players

Games

None of the above

Discuss

Answer: (c).Games

Q82.

The process of inserting a node in a binary search tree can be divided into how many steps?

Three

Two

Four

None of the above

Discuss

Answer: (b).Two

Q83.

The number of nodes in a complete binary tree of depth d (with root at depth 0) is

2^(d−1) +1

2^(d+1) -1

2^(d−1) -1

2^(d+1) +1

Discuss

Answer: (b). 2^(d+1) -1

Q84.

Every internal node in a B-tree of minimum degree 2 can have

2, 3 or 4 children

1, 2 or 3 children

2, 4 or 6 children

0, 2 or 4 children

Discuss

Answer: (b).1, 2 or 3 children

Q85.

In .............. the difference between the height of the left sub tree and height of right sub tree, for each node, is not more than one.

BST

Complete Binary Tree

AVL-tree

Balanced Search tree

Discuss

Answer: (c).AVL-tree

Q86.

The in-order traversal of a binary tree is HFIEJGZ, and the post-order traversal of the same tree is HIFJZGE. What will be the total number of nodes in the left sub tree of the given tree? (It is NOT a search tree)

Discuss

Answer: (c).3

Q87.

If the in-order and pre-order traversal of a binary tree are D,B,F,E,G,H,A,C and A,B,D,E,F,G,H,C respectively then the post-order traversal of that tree is

D,F,G,A,B,C,H,E

F,H,D,G,E,B,C,A

C,G,H ,F,E,D,B,A

D,F,H,G,E,B,C,A

Discuss

Answer: (d).D,F,H,G,E,B,C,A

Q88.

In a binary tree, the number of terminal or leaf nodes is 10. The number of nodes with two children is

Discuss

Answer: (a).9

Q89.

The pre-order traversal of a binary-search tree is DBACFE. What is the post-order traversal?

ABFCDE

ADBFEC

ABFEDC

ACBEFD

Discuss

Answer: (d).ACBEFD

Q90.

What could be the worst case height of an AVL tree?

0.97 log n

2.13 log n

1.44 log n

n^2 log n

Discuss

Answer: (c).1.44 log n

Page 9 of 32

Welcome to the Trees MCQs Page

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

Computer Hardware

Wireless and Mobile Communications

HTML

Formal Languages and Automata Theory

UNIX

MongoDB

Systems Analysis and Design Methods

Microprocessor