Menu

Question Discussion & Solution

MCQ
Q.
What are the worst case and average case complexities of a binary search tree?

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.
Binary search tree is an example of complete binary tree with special attributes.
forum Discussion
MCQ
2.
The number of unused pointers in a complete binary tree of depth 5 is:
forum Discussion
MCQ
3.
Recursive algorithms are based on
forum Discussion
MCQ
4.
Disadvantage of using array representation for binary trees is?
forum Discussion
MCQ
5.
Which of the following graph traversals closely imitates level order traversal of a binary tree?
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