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

Q101.

A tree in which, for every node, the difference between the height of its left subtree and right subtree is not more than one is

Complete Binary Tree

B – Tree

B+ Tree

AVL Tree

Discuss

Answer: (d).AVL Tree

Q102.

A binary tree stored using linked representation can be converted to its mirror image by traversing it in ...............

In-order

Pre-order

Post-order

Any order

Discuss

Answer: (b).Pre-order

Q103.

The balance factor for an AVL tree is either

0,1 or -1

-2,-1 or 0

0,1 or 2

All the above

Discuss

Answer: (a).0,1 or -1

Q104.

AVL trees have LL, LR, RR, RL rotations to balance the tree to maintain the balance factor (LR : Insert node in Right sub tree of Left sub tree of node A, etc). Among rotations the following are single and double rotations

LL, RL and LR, RR

LL, RR and LR, RL

LR, RR and LL, RL

LR, RL and LR, RL Answer: B

Discuss

Answer: (b).LL, RR and LR, RL

Q105.

Heap is an example of ................

complete binary tree

spanning tree

sparse tree

binary search tree

Discuss

Answer: (a).complete binary tree

Q106.

The number of unused pointers in a complete binary tree of depth 5 is:

Discuss

Answer: (c).16

Q107.

The running time for creating a heap of size n is .............

O(n)

O(log n)

O(n log n)

O(n^2)

Discuss

Answer: (c).O(n log n)

Q108.

One can determine whether a Binary tree is a Binary Search Tree by traversing it in ................

Pre-order

In-order

Post-order

Any of these

Discuss

Answer: (b).In-order

Q109.

The maximum number of nodes in a binary tree of depth 5 is ...............

Discuss

Answer: (a).31

Q110.

In a min-heap:

parent nodes have values greater than or equal to their Children

parent nodes have values less than or equal to their Children

both statements are true

both statements are wrong

Discuss

Answer: (a).parent nodes have values greater than or equal to their Children

Page 11 of 32

Welcome to the Trees MCQs Page

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

Management Information Systems

Neural Networks

Object Oriented Programming

Cryptography and Network Security

Digital Communication

Software Engineering

Formal Languages and Automata Theory

Compiler Design

Big Data Computing