什么是不太知名但有用的数据结构？ [英] 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：我是也对跳舞链接的技术感兴趣，这些技术巧妙地使用了通用数据结构的属性。

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

编辑：
请尝试将链接更详细地描述数据结构的页面。此外，尝试在上添加几个单词，为什么数据结构很酷（如 JonasKö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.

推荐答案

Tries ，也称为前缀树或 crit-bit tree ，已经存在了40多年，但仍然是相对未知的。 TRASH - 一个动态的LC-trie和哈希数据结构，它将特里与散列函数相结合。

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屋！