---
title: "Comment by Frank Reese on \"Comparing Data Structures: Stacks vs Queues\" | Hashnode"
description: "This is extremely good, but I wish you used very low level code to show how to code these in all languages (aka c). Or showed a code version of a Queue. However"
url: "https://hashnode.com/posts/comparing-data-structures-stacks-vs-queues/6578895a316a144a081610f4/comment/657b7995d69ca11ab788bf72"
---

[Discussion](https://hashnode.com/posts/comparing-data-structures-stacks-vs-queues/6578895a316a144a081610f4)

Comment [Comparing Data Structures: Stacks vs Queues](https://hashnode.com/posts/comparing-data-structures-stacks-vs-queues/6578895a316a144a081610f4)

[Frank Reese](https://hashnode.com/@Kinglink)

[Dec 14, 2023](https://hashnode.com/posts/comparing-data-structures-stacks-vs-queues/6578895a316a144a081610f4/comment/657b7995d69ca11ab788bf72)

This is extremely good, but I wish you used very low level code to show how to code these in all languages (aka c). Or showed a code version of a Queue. However I don't think Queues are necessarily "Slower" but they have different uses and purposes obviously. if you need LIFO, you pretty much need to use a stack, if you have FIFO you need to use a queue. That's the big different at least in my view.

However I won't disagree with any of your points, they're all good, I just believe a more indepth design of how to write a (static size) queue or stack might be clear so people understand what's happening.

Thanks for the article.

[Sirus Salari](https://hashnode.com/@ScrappedScript)

[Dec 15, 2023](https://hashnode.com/posts/comparing-data-structures-stacks-vs-queues/6578895a316a144a081610f4/comment/657b7995d69ca11ab788bf72#reply-657b98acd69ca11ab7898a9d)

Hey Frank, thank you so much for the feedback, I really appreciate it!

I absolutely agree with you, and I think it’d be a great idea to include code examples from other languages like C in future articles.
