Q. What is the time complexity of the program to reverse stack when linked list is used for its implementation?

(A) o(n)
(B) o(n log n)
(C) o(n2)
(D) o(log n)

💬 Discuss

✅ Correct Answer: (A) o(n)

Explanation: as a linked list takes o(n) time for getting reversed thus linked list version of stack will also take the same time.

Published by Mr. Dubey ⭐ 111.42K Points at 16-Sep-2023 03:43 pm in Design and Analysis of Algorithms

Explanation by: Mr. Dubey

as a linked list takes o(n) time for getting reversed thus linked list version of stack will also take the same time.

💬 Discussion

📊 Question Analytics

👁️

148

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

80%

Success Rate