Menu

Question Discussion & Solution

MCQ
Q.
Traversing a binary tree refers to the process of visiting each and every node of the tree exactly how many times?

forum Community Discussion

speaker_notes_off

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

login Login to Discuss

auto_awesome Similar Questions

MCQ
1.
How many distinct binary search trees can be formed which contains the integers 1, 2, 3?
forum Discussion
MCQ
2.
If the tree is not a complete binary tree then what changes can be made for easy access of children of a node in the array ?
forum Discussion
MCQ
3.
The following lines talks about deleting a node in a binary tree.(the tree property must not be violated after deletion)
i) from root search for the node to be deleted

ii)

iii) delete the node at

what must be statement ii) and fill up statement iii)
forum Discussion
MCQ
4.
What is the maximum possible number of nodes in a binary tree at level 6?
forum Discussion
MCQ
5.
The number of unused pointers in a complete binary tree of depth 5 is:
forum Discussion

category More Data Structure Topics

article

Data Structure Basics

format_list_bulleted 128 MCQs
article

Abstract data types

format_list_bulleted 37 MCQs
article

Arrays

format_list_bulleted 134 MCQs
article

Lists

format_list_bulleted 166 MCQs
article

Stacks

format_list_bulleted 165 MCQs
article

Queues

format_list_bulleted 61 MCQs
article

Trees

format_list_bulleted 133 MCQs
article

Binary Trees

format_list_bulleted 120 MCQs
article

B Trees

format_list_bulleted 8 MCQs
article

Heaps

format_list_bulleted 36 MCQs
article

Hash based structures

format_list_bulleted 7 MCQs
article

Graphs

format_list_bulleted 157 MCQs
article

Mixed

format_list_bulleted 10 MCQs