Menu

Question Discussion & Solution

MCQ
Q.
In .............. the difference between the height of the left sub tree and height of right sub tree, for each node, is not more than one.

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.
Consider a sequence of numbers to have repetitions, how a cartesian tree can be constructed in such situations without violating any rules?
forum Discussion
MCQ
2.
Internal nodes have___________.
forum Discussion
MCQ
3.
A __________is a non-linear data structure representing the hierarchical structure of one or more elements known as nodes.
forum Discussion
MCQ
4.
Consider the below formations of red-black tree. All the below formations are incorrect for it to be a redblack tree. Then what may be the correct order?

data-structure-questions-answers-red-black-tree-q3
forum Discussion
MCQ
5.
State true or false.i) An empty tree is also a binary tree.ii) In strictly binary tree, the out-degree of every node is either o or 2.
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