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

Q131.

Consider the following nested representation of binary trees indicates y and z are the left right subtrees, respectively, of node x. Note that y and z may be NULL or further nested. Which of the following represents a valid binary tree?

(1(234)(567)

(1 2(4 5 6 7))

(1(2 3 NULL)(4 5))

1((2 3 NULL)4 5 6)7)

Discuss

Answer: (a).(1(234)(567)

Q132.

B+- trees are preferred to binary trees in databases because

Disk access is much slower than memory Access

Disk capacities are greater than memory capacities

Disk data transfer rates are much less than memory data transfer rates

All of above

Discuss

Answer: (a).Disk access is much slower than memory Access

Q133.

A full binary tree with n non-leaf nodes contains

2n nodes

n - 1 nodes

log2n nodes

2n + 1 nodes

Discuss

Answer: (d).2n + 1 nodes

Q134.

The depth of a complete binary tree with 'n nodes is (log is to be base two)

log(n)

log(n) + 1

log (n-1) + 1

log (n+1)-1

Discuss

Answer: (d).log (n+1)-1

Q135.

What must be the missing logic below so as to print mirror of a tree as below as an example?

if(rootnode):
  mirror(rootnode-->left)
  mirror(rootnode-->right)
 
  //missing
 
end

swapping of left and right nodes is missing

swapping of left with root nodes is missing

swapping of right with root nodes is missing

nothing is missing

Discuss

Answer: (a).swapping of left and right nodes is missing

Q136.

Which of the below diagram is following AVL tree property?

only i

only i and ii

only ii

none of the mentioned

Discuss

Answer: (b).only i and ii

Q137.

Is the below tree representation of 50,100,400,300,280 correct way to represent cartesian tree?

true

false

may be

can't say

Discuss

Answer: (a).true

Q138.

What is the condition for a tree to be weight balanced. where a is factor and n is a node?

weight[n.left] >= a*weight[n] and weight[n.right] >= a*weight[n].

weight[n.left] >= a*weight[n.right] and weight[n.right] >= a*weight[n].

weight[n.left] >= a*weight[n.left] and weight[n.right] >= a*weight[n].

weight[n] is a non zero

Discuss

Answer: (a).weight[n.left] >= a*weight[n] and weight[n.right] >= a*weight[n].

Q139.

What are the operations that can be performed on weight balanced tree?

all basic operations and set intersection, set union and subset test

all basic operations

set intersection, set union and subset test

only insertion and deletion

Discuss

Answer: (a).all basic operations and set intersection, set union and subset test

Q140.

Consider a weight balanced tree such that, the number of nodes in the left sub tree is at least half and at most twice the number of nodes in the right sub tree. The maximum possible height (number of nodes on the path from the root to the farthest leaf) of such a tree on k nodes can be described as

log2 n

log4/3 n

log3 n

log3/2 n

Discuss

Answer: (d).log3/2 n

Page 14 of 32

Welcome to the Trees MCQs Page

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

MATLAB

Neural Networks

Data Structures and Algorithms

Digital Image Processing (DIP)

CSS

Software Architecture and Design

Wireless and Mobile Communications

Systems Analysis and Design Methods

SQL Server