Linked List

Choose difficulty:

Beginner

Intermediate

Advanced

1. In a circular linked list

a: We can navigate through the linked list in reverse order Explanation

Explanation

b: There is no beginning and no end Explanation

Explanation

c: Searching is faster than in a singly Linked list Explanation

Explanation

d: None of these Explanation

Explanation

2. In a circular linked list, if we insert an element how many pointers do we have to update?

a: 0 Explanation

Explanation

b: 1 Explanation

Explanation

c: 2 Explanation

Explanation

d: 3 Explanation

Explanation

3. What is the time complexity for deleting an element from a circular linked list?

a: O(1) Explanation

Explanation

b: O(log n) Explanation

Explanation

c: O(n) Explanation

Explanation

d: O(n^2) Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

AGPL 3.0 & Creative Commons (CC BY-NC-SA 4.0)