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

Q261.

Left child of parent node has value lesser than the parent node.

True

False

May be

Can't say

Discuss

Answer: (b).False

Q262.

What is the other name of weak heap?

Min-heap

Max-heap

Relaxed -heap

Leonardo heap

Discuss

Answer: (c).Relaxed -heap

Q263.

What is the worst case time in searching minimum value in weak -heap?

O(log n)

O(n)

O(n logn)

O(1)

Discuss

Answer: (d).O(1)

Q264.

The total comparisons in finding both smallest and largest elements are

2*n +2

n + ((n+1)/2) -2

n+logn

n^2

Discuss

Answer: (b).n + ((n+1)/2) -2

Q265.

What is the complexity of given function of insertion.

insert(int n)
 {
  if(buffer_size()< maxi_biffer_size())
  buffer_aar[ind]==n;
  else
  move_to_heap(buffer,buffer+maxi_buffer_size())
 }

O(logn)

amortized O(1)

O(n)

None of the mentioned

Discuss

Answer: (b).amortized O(1)

Q266.

Does there exist a heap with seven distinct elements so that the Inorder traversal gives the element in sorted order.

Yes

May be

Can't say

Discuss

Answer: (b).No

Q267.

The leaf node for a heap of height h will be at which position.

h-1

h or h-1

None of the mentioned

Discuss

Answer: (c).h or h-1

Q268.

The main distinguishable characterstic of a binomial heap from a binary heap is that

it allows union operations very efficiently

it does not allow union operations that could easily be implemented in binary heap

the heap structure is not similar to complete binary tree

the location of child node is not fixed i.e child nodes could be at level (h-2) or (h-3), where h is height of heap and h>4

Discuss

Answer: (a).it allows union operations very efficiently

Q269.

The number of trees in a binomial heap with n nodes is

logn

nlogn

n/2

Discuss

Answer: (a).logn

Q270.

In a binomial heap the root value is greater than left child and less than right child.

True

False

May be

Can't say

Discuss

Answer: (b).False

Page 27 of 32

Welcome to the Trees MCQs Page

Trees MCQs | Page 27 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 Programming

Computer Graphics

Formal Languages and Automata Theory

Digital Communication

Data Warehousing and OLAP

IT Fundamentals

Systems Programming

Data Science

Microprocessor