你应该听到什么复杂的数据结构？ [英] What are the complicated data structures you should have heard of?

问题描述

这是一个衍生的问题，但我正在询问您应该至少熟悉其数据结构的有用性。这些结构太难以实现，但没有一些专业知识。

This is a derivative question, but I'm inquiring as to the data structures that you should at least be familiar with for their usefulness. These structures are too hard to implement without some expertise however.

我会说两者之间的一个好的边界是一个堆 - 你应该能够编码一个堆，但它会带你一天。不适合这将是一个BST等。编辑：我看到这一点，它取决于你在做什么。我想这是一个很简单的列表，一个短语总结了你为什么使用它！

I would say a good boundary between the two is a heap -- you should be able to code a heap, but it would take you a day. Not appropriate for this would be a BST, etc. I see the point that it depends on what you are doing. I think it would be awesome to have a list with a phrase summarizing why you use it!

这里有一个列表开始：

1. B +树：单键上的良好的一般索引结构


2. Kd树：空间数据


3. 红黑树：自平衡BST;也可以是AVL或splay树


4. 跳过列表：随机或（伪）顺序访问的良好混合结构


5. Trie：线性时间字符串搜索
6. 
   

1. B+ trees: good general indexing structure on a single key
2. K-d tree: spatial data
3. Red-black tree: self-balancing BST; also AVL or splay tree
4. Skip list: good hybrid structure for either random or (pseudo)sequential access
5. Trie: linear time string search

推荐答案

Bloom filters

这篇关于你应该听到什么复杂的数据结构？的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！