Menu

Question Discussion & Solution

MCQ
Q.
When we have red-black trees and AVL trees that can perform most of operations in logarithmic times, then what is the need for splay trees?

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 below sequences:

array=60 90 10 100 40 150 90

reverse 2 to 3

array=60 10 90 100 40 150 90

reverse 3 to 6

array= 60 100 150 40 100 90 90

now printout from 1 to 6 :-- 60 100 150 40 100 90

How to achieve the above operation efficiently?
forum Discussion
MCQ
2.
Which of the following property of splay tree is correct?
forum Discussion
MCQ
3.
The node at the top of a tree is known as the ________of the tree.
forum Discussion
MCQ
4.
After the insertion operation, is the resultant tree a splay tee?
forum Discussion
MCQ
5.
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 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