Question Discussion & Solution

MCQ

Average case time complexity of binary search is ______________

O(n)

?(nlogn)

O(logn)

?(logn)

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

A binary tree is said to be a complete binary tree if all the leaf nodes of the tree are at ________.

Same level

Opposite level

Different level

Adjacent level

Discussion

MCQ

Worst case time complexity of binary search is ______________

O(n)

O(logn)

?(nlogn)

?(logn)

Discussion

MCQ

Best case time complexity of binary search is ______________

O(n)

?(nlogn)

O(logn)

?(logn)

Discussion

MCQ

What is the speciality about the inorder traversal of a binary search tree?

It traverses in a non increasing order

It traverses in an increasing order

It traverses in a random fashion

None of the mentioned

Discussion

MCQ

What are the children for node

2w and 2w+1

2+w and 2-w

w+1/2 and w/2

w-1/2 and w+1/2

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics