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 12 of 32

Explore more Topics under Data Structures and Algorithms

Q111.
A complete binary tree with n leaf nodes has ..............

a.

n+1 nodes

b.

2n-1 nodes

c.

2n+1 nodes

d.

n(n-1)/2 nodes

Discuss
Answer: (b).2n-1 nodes
Q112.
A binary tree can be converted in to its mirror image by traversing it in ..............

a.

In-order

b.

Pre-order

c.

Post-order

d.

Any order

Discuss
Answer: (b).Pre-order
Q113.
Which one of the following statements is false?

a.

Breadth-first search cannot be used to find connected components of a graph.

b.

Given the prefix and postfix walks of a binary tree, the binary tree cannot be uniquely reconstructed.

c.

Both (a) and (b)

d.

Optimal binary search tree construction can be performed efficiently using dynamic programmmg.

Discuss
Answer: (c).Both (a) and (b)
Q114.
A list integers is read in, one at a time, and a binary search tree is constructed. Next the tree is traversed would result in a printout which duplicates the original order of the list of integers?

a.

Inorder

b.

Preorder

c.

Postorder

d.

None of these

Discuss
Answer: (d).None of these
Q115.
Which of the following need not to be a binary tree ?

a.

Heap

b.

B-Tree

c.

AVL-Tree

d.

Search tree

Discuss
Answer: (b).B-Tree
Q116.
Which of the following statements is false ?

a.

A tree contains a cycle

b.

A tree is a connected graph

c.

Every tree is a bipartite graph

d.

A tree with n nodes contains n-1 edges

Discuss
Answer: (a).A tree contains a cycle
Q117.
Which of the following remarks about Tree- indexing are true?

a.

It is an m-ary tree

b.

Successful searches should terminate in leaf nodes

c.

Unsuccessful searches may terminate in leaf nodes level of the tree structure

d.

All of these

Discuss
Answer: (d).All of these
Q118.
A binary tree in which if all its levels except possibly the last, have the maximum number of nodes and all the nodes at the last level appear as far left as possible, is called

a.

Threaded tree

b.

Full binary tree

c.

Binary Search Tree

d.

Complete binary tree

Discuss
Answer: (d).Complete binary tree
Q119.
A complete binary tree with the property that the value at each node is at least as large as the values at its children is called

a.

Heap

b.

Binary Tree

c.

Binary search tree

d.

Completely balanced tree

Discuss
Answer: (a).Heap
Q120.
Traversing a binary tree first root and then left and right subtrees called _______traversal.

a.

inorder

b.

preorder

c.

postorder

d.

none of these

Discuss
Answer: (b).preorder
Page 12 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!

Operating System

Dive deep into the core of computers with our Operating System MCQs. Learn about...

Java Programming

Level up your coding skills with our Java Programming MCQs. From object-oriented...

UNIX

Become proficient with the Unix operating system using our UNIX MCQs. Learn about...

Visual Basic

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

Computer Hardware

Explore the tangible components of computers with our Computer Hardware MCQs. Learn...

C Programming

Master one of the most widely used programming languages with our C Programming MCQs....

Digital Communication

Master the basics of electronic communication with our Digital Communication MCQs....

MongoDB

Learn the leading NoSQL database with our MongoDB MCQs. Understand everything from...

Data Structures and Algorithms

Journey through the fundamentals of Data Structures and Algorithms with our extensive...