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

Explore more Topics under Data Structures and Algorithms

Q1.
The following formula is of :

left_subtree (keys) ≤ node (key) ≤ right_subtree (keys)

a.

Bianry Tree

b.

Complete Binary Tree

c.

Binary Search Tree

d.

All of the above

Discuss
Answer: (c).Binary Search Tree
Q2.
Binary search tree has best case run-time complexity of Ο(log n). What could the worst case?

a.

Ο(n)

b.

Ο(n2)

c.

Ο(n3)

d.

None of the above

Discuss
Answer: (a).Ο(n)
Q3.
In order traversal of binary search tree will produce −

a.

unsorted list

b.

reverse of input

c.

sorted list

d.

none of the above

Discuss
Answer: (c).sorted list
Q4.
In binary heap, whenever the root is removed then the rightmost element of last level is replaced by the root. Why?

a.

It is the easiest possible way.

b.

To make sure that it is still complete binary tree.

c.

Because left and right subtree might be missing.

d.

None of the above.

Discuss
Answer: (b).To make sure that it is still complete binary tree.
Q5.
If we choose Prim's Algorithm for uniquely weighted spanning tree instead of Kruskal's Algorithm, then

a.

we'll get a different spanning tree.

b.

we'll get the same spanning tree.

c.

spanning will have less edges.

d.

spanning will not cover all vertices.

Discuss
Answer: (b).we'll get the same spanning tree.
Q6.
The number of binary trees with 3 nodes which when traversed in post order gives the sequence A,B,C is ?

a.

3

b.

4

c.

5

d.

6

Discuss
Answer: (c).5
Q7.
Which method can find if two vertices x & y have path between them?

a.

Depth First Search

b.

Breadth First Search

c.

Both A & B

d.

None A or B

Discuss
Answer: (c).Both A & B
Q8.
Access time of a binary search tree may go worse in terms of time complexity upto

a.

Ο(n2)

b.

Ο(n log n)

c.

Ο(n)

d.

Ο(1)

Discuss
Answer: (c).Ο(n)
Q9.
Visiting root node after visiting left and right sub-trees is called

a.

In-order Traversal

b.

Pre-order Traversal

c.

Post-order Traveral

d.

None of the above

Discuss
Answer: (c).Post-order Traveral
Q10.
In the deletion operation of max heap, the root is replaced by

a.

next available value in the left sub-tree.

b.

next available value in the right sub-tree.

c.

any random value from the heap.

d.

last element of the last level

Discuss
Answer: (d).last element of the last level
Page 1 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!

MS Office

Master the suite of productivity tools with our MS Office MCQs. From Word and Excel...

Systems Programming

Decode low-level programming with our Systems Programming MCQs. These questions delve...

Computer Graphics

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

Cloud Computing

Stay on top of the biggest trend in IT with our Cloud Computing MCQs. These questions...

MongoDB

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

Discrete Mathematics

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

Object Oriented Programming

Enhance your coding skills with our Object Oriented Programming MCQs. Understand...

Visual Basic

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

C# programming

Hone your skills in the C# language with our MCQs. Understand data types, operators,...