Question Discussion & Solution

MCQ

Is it true that splay trees have O(logn) amortized complexity ?

May be

Can't say

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

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

In-order Traversal

Pre-order Traversal

Post-order Traveral

None of the above

Discussion

MCQ

Which of the following is not an advantage of trees?

Hierarchical structure

Faster search

Router algorithms

Undo/Redo operations in a notepad

Discussion

MCQ

Which concept is useful while writing programming code for implementing various operations on trees?

Recursion

Huffman

Internal nodes

None of the above

Discussion

MCQ

What is direct addressing?

Distinct array position for every possible key

Fewer array positions than keys

Fewer keys than array positions

None of the mentioned

Discussion

MCQ

Cartesian trees solve range minimum query problem in constant time

May be

Can't say

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