Vidyalelo
Data Structure · Q39

Stacks in Data Structures

Programming · Data Structure · question 39

Q39

What is the time complexity of accessing an element at the bottom of a stack implemented using a linked list?

A.
O(1)
B.
O(n)
Answer
C.
O(log n)
D.
O(n log n)

Answer: Option B

Solution

Answer: Option B
No explanation is given for this question Let's Discuss on Board