Menu

Question Discussion & Solution

MCQ

Q.

To which datastructure are skip lists similar to in terms of time complexities in worst and best cases?

A

balanced binary search trees

B

binary search trees

C

binary trees

D

linked lists

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Login to Discuss

Similar Questions

MCQ

1.

What is the space complexity for deleting a linked list?

A

O(1)

B

O(n)

C

Either O(1) or O(n)

D

O(logn)

Discussion

MCQ

2.

Which of the following application makes use of a circular linked list?

A

Undo operation in a text editor

B

Recursive function calls

C

Allocating CPU to resources

D

All of the mentioned

Discussion

MCQ

3.

The time required to delete a node x from a doubly linked list having n nodes is

A

O (n)

B

O (log n)

C

O (1)

D

O (n log n)

Discussion

MCQ

4.

The last node of the singly-linked list contains__________.

A

Info

B

NULL

C

Next

D

None of the above

Discussion

MCQ

5.

In a linked list array, objects are referred to as

A

Instances

B

Attributes

C

Nodes

D

Entity

Discussion

More Data Structure Topics

Data Structure Basics

128 MCQs

Abstract data types

37 MCQs

Arrays

134 MCQs

Lists

166 MCQs

Stacks

165 MCQs

Queues

61 MCQs

Trees

133 MCQs

Binary Trees

120 MCQs

B Trees

8 MCQs

Heaps

36 MCQs

Hash based structures

7 MCQs

Graphs

157 MCQs

Mixed

10 MCQs