Revealing the frontier with stacks and queues
The article discusses the advantages of using stacks and queues for tree and graph traversal over traditional recursion. It highlights how stacks can simplify control flow and handle real-world complexities better than recursive methods. Additionally, it contrasts depth-first and breadth-first search techniques, emphasizing their respective use cases.
- ▪Stacks and queues provide a more adaptable mental model for programming compared to recursion.
- ▪Depth-first traversal can be implemented using both recursive and stack-based approaches, each with its own advantages and drawbacks.
- ▪Breadth-first search can be easily achieved by using a FIFO queue instead of a LIFO stack.
Lobsters files mainly under programming. We currently carry 187 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | Dystroy |
| Canonical URL | https://dystroy.org/blog/stack-and-queues/ |
| Publication time | Wed, 03 Jun 2026 02:55:57 -0500 |
| Retrieval time | 2026-06-03T08:11:59.578Z |
| Last seen | 2026-06-03T08:11:59.578Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | LA2_sxIhgCIH |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
Opening excerpt (first ~120 words) tap to expand
Revealing the frontier with stacks and queues 5 minute read Published: 2026-06-02 Table of Contents Introduction Tree traversal Depth-first traversal in natural order When no order is required Breadth-First Search Graph exploration The core approach Being able to think in stacks and queues is a neglected super-power. It's often a better way to see problems than recursion when trees and other graphs are involved. CS Courses like to teach recursion, because it looks simple and elegant, especially when Functional Programming is in the curriculum, and especially when drawn on a black board. You've probably already read a few times, and maybe experienced yourself, that recursion isn't always efficient, especially on modern computers.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at Dystroy.
Discussion
0 commentsMore from Dystroy
