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

Q121.

A binary tree having n nodes and depth d will be about complete binary tree if

it contains log(d)+1 nodes

any node nd at level less than d-1 has two sons

for any node nd in the tree with a right descendent at level d lt must have a left son

all of these

Discuss

Answer: (b).any node nd at level less than d-1 has two sons

Q122.

Which of the following statements is/are correct ?

If each tree node contains a father field, then it's not necessary to use either stack or threads

A in-threaded binary tree is defined as binary tree that is both left-in threaded and right-in

Both (a) and (b)

Traversal using father pointers is more time efficient than traversal of a threaded tree

Discuss

Answer: (c).Both (a) and (b)

Q123.

A binary tree of depth "d" is an almost complete binary tree if

for any node

each leaf in the tree is either at level

both (a) and (b)

None of these

Discuss

Answer: (c).both (a) and (b)

Q124.

If each node in a tree has value greater the every value in its left subtree and has value less than every value in its right subtree, the tree is called

AVL tree

Complete tree

Full binary tree

Binary search tree

Discuss

Answer: (d).Binary search tree

Q125.

The number of nodes in a complete binary tree of level 5 is

Discuss

Answer: (c).63

Q126.

The smallest number of key that will force a B-tree of order 3 to have a height 3 is

Discuss

Answer: (b).7

Q127.

A binary tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 10 leaves

Has exactly 17 nodes

Has exactly 19 nodes

Cannot have more than 19 nodes

None of these

Discuss

Answer: (b).Has exactly 19 nodes

Q128.

Number of possible binary trees with 3 nodes is

Discuss

Answer: (a).5

Q129.

A-2-3 tree is a tree such that 1. All internal nodes have either 2 or 3 children. 2. All paths from root to the leaves have the same length. The number of internal nodes of a 2-3 tree having 9 leaves could be

Discuss

Answer: (b).4

Q130.

A binary tree is generated by inserting in order the following integers: 50, 15, 62, 5, 20,58, 91, 3,8,37, 60, 24 The number of nodes in the left of the root respectively is

(3,6)

(4,7)

(6,3)

(7,4)

Discuss

Answer: (d).(7,4)

Page 13 of 32

Welcome to the Trees MCQs Page

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

Java Spring Framework

Data Structures and Algorithms

Cloud Computing

UNIX

Artificial Intelligence

CompTIA PenTest+ Certification Exam PT0 002

Digital Image Processing (DIP)

PHP

C Programming