Q. Worst space complexity of queue data structure is

(A) o(n)
(B) o(log(n))
(C) o(1)
(D) n/a

💬 Discuss

✅ Correct Answer: (A) o(n)

Published by Mr. Dubey ⭐ 104.82K Points at 16-Sep-2023 03:13 pm in Data Structure (DS)

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

921

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

97%

Success Rate