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

Q241.

What are the disadvantages of normal binary tree traversals?

there are many pointers which are null and thus useless

there is no traversal which is efficient

complexity in implementing

improper traversals

Discuss

Answer: (a).there are many pointers which are null and thus useless

Q242.

What may be the content of a node in threaded binary tree?

leftchild_pointer, left_tag, data, right_tag, rightchild_pointer

leftchild_pointer, left_tag

leftchild_pointer, left_tag, right_tag, rightchild_pointer

leftchild_pointer, left_tag, data

Discuss

Answer: (a).leftchild_pointer, left_tag, data, right_tag, rightchild_pointer

Q243.

What are null nodes filled with in a threaded binary tree?

inorder predecessor for left node and inorder successor for right node information

right node with inorder predecessor and left node with inorder successor information

they remain null

some other values randomly

Discuss

Answer: (a).inorder predecessor for left node and inorder successor for right node information

Q244.

The null left pointer pointing to predecessor and null right pointer pointing to successor. how many types of threaded tree are possible with this convention?

inorder, postorder, preorder traversals

inorder

postorder

preorder

Discuss

Answer: (a).inorder, postorder, preorder traversals

Q245.

What are double and single threaded trees?

when both left, right nodes are having null pointers and only right node is null pointer respectively

having 2 and 1 node

using single and double linked lists

using heaps and priority queues

Discuss

Answer: (a).when both left, right nodes are having null pointers and only right node is null pointer respectively

Q246.

What is wrong with below code for inorder traversal of inorder threaded binary tree:

 inordertraversal(threadedtreenode root):
   threadedtreenode q = inorderpredecessor(root)
   while(q!=root):
   q=inorderpredecessor(q)
   print q.data

inordersuccessor instead of inorderpredecessor must be done

code is correct

it is code for post order

it is code for pre order

Discuss

Answer: (a).inordersuccessor instead of inorderpredecessor must be done

Q247.

In a max-heap, element with the greatest key is always in the which node?

Leaf node

First node of left sub tree

root node

First node of right sub tree

Discuss

Answer: (c).root node

Q248.

Heap exhibits the property of a binary tree?

True

False

May be

Can't say

Discuss

Answer: (a).True

Q249.

What is the complexity of adding an element to the heap.

O(log n)

O(h)

O(log n) & O(h)

None of the mentioned

Discuss

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

Q250.

The worst case complexity of deleting any arbitrary node value element from heap is

O(logn)

O(n)

O(nlogn)

O(n^2)

Discuss

Answer: (a).O(logn)

Page 25 of 32

Welcome to the Trees MCQs Page

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

Digital Image Processing (DIP)

Object Oriented Programming Using C++

Cryptography and Network Security

SQL Server

Object Oriented Programming

Discrete Mathematics

CSS

Neural Networks

HTML