什么是鲜为人知但有用的数据结构? [英] What are the lesser known but useful data structures?

问题描述

有一些数据结构非常有用，但大多数程序员都不知道.他们是哪些?

There are some data structures around that are really useful but are unknown to most programmers. Which ones are they?

每个人都知道链表、二叉树和哈希，但是跳过列表和 布隆过滤器 为例.我想了解更多不那么常见但值得了解的数据结构，因为它们依赖于伟大的想法，丰富了程序员的工具箱.

Everybody knows about linked lists, binary trees, and hashes, but what about Skip lists and Bloom filters for example. I would like to know more data structures that are not so common, but are worth knowing because they rely on great ideas and enrich a programmer's tool box.

PS:我也对 Dancing links 之类的技术感兴趣，这些技术巧妙地利用了属性一个通用的数据结构.

PS: I am also interested in techniques like Dancing links which make clever use of properties of a common data structure.

编辑:请尝试包含链接到更详细地描述数据结构的页面.此外，尝试添加一些关于为什么数据结构很酷的词(如Jonas Kölker 已经指出).此外，尝试为每个答案提供一个数据结构.这将允许更好的数据结构仅根据他们的投票浮动到顶部.

EDIT: Please try to include links to pages describing the data structures in more detail. Also, try to add a couple of words on why a data structure is cool (as Jonas Kölker already pointed out). Also, try to provide one data-structure per answer. This will allow the better data structures to float to the top based on their votes alone.

推荐答案

尝试，也被称为前缀树或 暴击位树，已经存在了 40 多年，但仍然存在比较陌生.TRASH - A dynamicLC-trie和hash数据结构"，结合了trie和hash函数.

Tries, also known as prefix-trees or crit-bit trees, have existed for over 40 years but are still relatively unknown. A very cool use of tries is described in "TRASH - A dynamic LC-trie and hash data structure", which combines a trie with a hash function.

这篇关于什么是鲜为人知但有用的数据结构?的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！