Menu

Question Discussion & Solution

MCQ
Q.
Access time of a binary search tree may go worse in terms of time complexity upto

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.
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 Discussion
MCQ
2.
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
MCQ
3.
Which of these operations have same complexities?
forum Discussion
MCQ
4.
Each node of a tree stores a data value and has zero or more pointers pointing to the other nodes of the tree, which are also known as its__________.
forum Discussion
MCQ
5.
Why Red-black trees are preferred over hash tables though hash tables have constant time complexity?
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