Data Structure Quiz 1

O(nlogn)

O(n)

O($n^{2}$)

O(1)

O(1)

O(n)

O(nlogn)

O($n^{2}$)

Stack

Queue

Array

Linked list

1,2,3,4

4,3,2,1

1,2,4,3

4,3,1,2

I only

I , II, III and IV

II and IV only

I , III only

Rear = front = -1

Rear = front = 1

Rear = 0 and front = -1

Rear = -1 and front = 0

Singly linked list

Doubly linked list

Circular doubly linked list

Array implementation of list

Singly linked list with head and tail pointers

Doubly linked list with only head pointer

Binary tree

Hash table

Possible if size of linked list is even

Possible if size of linked list is odd

Possible if x is not first node

Possible if x is not last node

No pointer

1 pointer

2 pointer

3 pointer