TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Ask HN: Favorite Data Structures?

2 点作者 atomicnature8 个月前
Hello HN,<p>Are there any lesser-known or underused data structures that you think should get more attention?<p>I’m asking because I recently implemented a custom tree structure to simplify some financial operations, and it made the solution look way simpler (where otherwise it would have been quite a mess). Trees aren’t exactly rare, of course, but it made me really appreciate how powerful the right data structure can be for a given problem.

2 条评论

breck8 个月前
Came here to say &quot;trees&quot;. ;)<p>If you have a 2 dimensional sheet of paper, with 3 syntax characters (space to separate words, newline to separate nodes, and a space to create scopes), you can create a tree representation of any structure (&#x27;All structures are trees&#x27; [0]). This is so useful and profound and will radically simplify the software world over the next 10 years.<p>Now if you have 4 dimensions, there&#x27;s other things you can do, but at this time, trees in 2D using the PPS stack (Particles, Parsers, and Scroll), are quite revolutionary and will help you scale exactly what you found in this case to all your software cases (going from quite a mess to way simpler).<p>[0] <a href="https:&#x2F;&#x2F;breckyunits.com&#x2F;treenotationPaper.html" rel="nofollow">https:&#x2F;&#x2F;breckyunits.com&#x2F;treenotationPaper.html</a>
评论 #41634292 未加载
daly8 个月前
VSAM