adplus-dvertising

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.

frame-decoration

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

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

a.

it contains log(d)+1 nodes

b.

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

c.

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

d.

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 ?

a.

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

b.

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

c.

Both (a) and (b)

d.

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

a.

for any node

b.

each leaf in the tree is either at level

c.

both (a) and (b)

d.

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

a.

AVL tree

b.

Complete tree

c.

Full binary tree

d.

Binary search tree

Discuss
Answer: (d).Binary search tree
Q125.
The number of nodes in a complete binary tree of level 5 is

a.

10

b.

21

c.

63

d.

77

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

a.

5

b.

7

c.

12

d.

16

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

a.

Has exactly 17 nodes

b.

Has exactly 19 nodes

c.

Cannot have more than 19 nodes

d.

None of these

Discuss
Answer: (b).Has exactly 19 nodes
Q128.
Number of possible binary trees with 3 nodes is

a.

5

b.

7

c.

9

d.

11

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

a.

2

b.

4

c.

6

d.

8

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

a.

(3,6)

b.

(4,7)

c.

(6,3)

d.

(7,4)

Discuss
Answer: (d).(7,4)
Page 13 of 32

Suggested Topics

Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!

Discrete Mathematics

Refine your mathematical skills essential for computer science with our Discrete...

Cyber Security

Understand the fundamentals of safeguarding digital assets with our Cyber Security...

Management Information Systems

Discover how businesses leverage technology with our Management Information Systems...

Embedded Systems

Dive into the world of specialized computing systems with our Embedded Systems MCQs....

Computer Architecture

Unveil the science behind computer design with our Computer Architecture MCQs. Topics...

Computer Graphics

Step into the visual side of computing with our Computer Graphics MCQs. Cover topics...

Visual Basic

Enhance your knowledge of Microsoft's event-driven programming language with our...

Compiler Design

Unravel the process of translating source code into executable programs with our...

Object Oriented Programming Using C++

Enhance your programming skills with our MCQs on Object Oriented Programming using...