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

Explore more Topics under Data Structures and Algorithms

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?

a.

(1(234)(567)

b.

(1 2(4 5 6 7))

c.

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

d.

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

a.

Disk access is much slower than memory Access

b.

Disk capacities are greater than memory capacities

c.

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

d.

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

a.

2n nodes

b.

n - 1 nodes

c.

log2n nodes

d.

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)

a.

log(n)

b.

log(n) + 1

c.

log (n-1) + 1

d.

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

a.

swapping of left and right nodes is missing

b.

swapping of left with root nodes is missing

c.

swapping of right with root nodes is missing

d.

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?

a.

only i

b.

only i and ii

c.

only ii

d.

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?

a.

true

b.

false

c.

may be

d.

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?

a.

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

b.

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

c.

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

d.

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?

a.

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

b.

all basic operations

c.

set intersection, set union and subset test

d.

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

a.

log2 n

b.

log4/3 n

c.

log3 n

d.

log3/2 n

Discuss
Answer: (d).log3/2 n
Page 14 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!

Object Oriented Programming Using C++

Enhance your programming skills with our MCQs on Object Oriented Programming using...

Human Computer Interaction

Enhance your knowledge of Human-Computer Interaction with our specialized MCQs....

Cyber Security

Understand the fundamentals of safeguarding digital assets with our Cyber Security...

Neural Networks

Dive into the world of Artificial Intelligence with our Neural Networks MCQs. Uncover...

CompTIA PenTest+ Certification Exam PT0 002

Prepare for the CompTIA PenTest+ PT0-002 exam with our targeted MCQs. Covering...

UNIX

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

Compiler Design

Unravel the process of translating source code into executable programs with our...

Software Architecture and Design

Get a strong hold on the blueprint of software systems with our Software Architecture...

Software Engineering

Learn about the systematic approach to developing software with our Software...