Q. Which of the following takes O(n) time in worst case in array implementation of stack?

(A) pop
(B) push
(C) isempty
(D) pop, push and isempty takes constant time

💬 Discuss

✅ Correct Answer: (D) pop, push and isempty takes constant time

Explanation: functions pop, push and isempty all are implemented in constant time in worst case.

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

Explanation by: Mr. Dubey

functions pop, push and isempty all are implemented in constant time in worst case.

💬 Discussion

📊 Question Analytics

👁️

856

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

91%

Success Rate