Menu

Question Discussion & Solution

MCQ
Q.
Consider a sequence of numbers to have repetitions, how a cartesian tree can be constructed in such situations without violating any rules?

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.
What are the operations that can be performed on weight balanced tree?
forum Discussion
MCQ
2.
The degree of a node is equal to the number of its__________.
forum Discussion
MCQ
3.
Why Red-black trees are preferred over hash tables though hash tables have constant time complexity?
forum Discussion
MCQ
4.
In how many different ways can a tree be traversed?
forum Discussion
MCQ
5.
In an arbitrary tree ( not a search tree) of order M. Its size is N, and its height is K. The computation time needed to find a data item on T 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