Question Discussion & Solution

MCQ

What is the search complexity in direct addressing?

O(n)

O(logn)

O(nlogn)

O(1)

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

How many nodes in a tree have no ancestors.

Discussion

MCQ

Visiting root node after visiting left and right sub-trees is called .............

In-order Traversal

Pre-order Traversal

Post-order Traversal

None of these

Discussion

MCQ

What maximum difference in heights between the leafs of a AVL tree is possible?

log(n) where n is the number of nodes

n where n is the number of nodes

0 or 1

atmost 1

Discussion

MCQ

Cartesian trees solve range minimum query problem in constant time

May be

Can't say

Discussion

MCQ

What is the special property of red-black trees and what root should always be?

a color which is either red or black and root should always be black color only

height of the tree

pointer to next node

a color which is either green or black

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