Check out my first novel, midnight's simulacra!
Trees: Difference between revisions
From dankwiki
(Created page with 'Trees? We've got all the trees you need! I'm thinking about writing a pop computer science book, one chapter on each of these. * red-black * AVL * pq * radix * fat * b * 2-3 * da...') |
No edit summary |
||
| (19 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
Trees? We've got all the trees you need! I'm thinking about writing a pop computer science book, one chapter on each of these. | Trees? We've got all the trees you need! I'm thinking about writing a pop computer science book, one chapter on each of these. | ||
* red-black | * red-black | ||
* AVL | * AVL (Adelson-Velsky + Landis) | ||
* pq | * pq | ||
* top | |||
* fat | |||
* b / b+ / 2-3 | |||
* vEB (van Emde Boas) | |||
* radix | * radix | ||
* dancing | * dancing | ||
* splay | * splay | ||
* trie | * trie | ||
* kd | * kd | ||
* | * (minimal) spanning | ||
* [[Gomory-Hu Tree|Gomory-Hu]] | |||
* decision | |||
* Hilbert R | |||
* game | |||
* aa | |||
* finger | |||
* Trémaux | |||
* Steiner | |||
* Order statistic | |||
* [https://en.wikipedia.org/wiki/Log-structured_merge-tree LSM] (log-structured merge) | |||
* [https://en.wikipedia.org/wiki/Cartesian_tree Cartesian] | |||
==[[Compiler Design|Compiling]]== | |||
* abstract syntax | |||
* doubly logarithmic | |||
* dominator | |||
... | ... | ||
==Theory== | |||
* Finite/Pushdown [[automata#Tree_automata|Tree Automata]] | |||
* Algebraic tree systems | |||
Revision as of 19:51, 18 November 2015
Trees? We've got all the trees you need! I'm thinking about writing a pop computer science book, one chapter on each of these.
- red-black
- AVL (Adelson-Velsky + Landis)
- pq
- top
- fat
- b / b+ / 2-3
- vEB (van Emde Boas)
- radix
- dancing
- splay
- trie
- kd
- (minimal) spanning
- Gomory-Hu
- decision
- Hilbert R
- game
- aa
- finger
- Trémaux
- Steiner
- Order statistic
- LSM (log-structured merge)
- Cartesian
Compiling
- abstract syntax
- doubly logarithmic
- dominator
...
Theory
- Finite/Pushdown Tree Automata
- Algebraic tree systems
