Check out my first novel, midnight's simulacra!
Trees: Difference between revisions
From dankwiki
No edit summary |
No edit summary |
||
| Line 27: | Line 27: | ||
* [https://en.wikipedia.org/wiki/Log-structured_merge-tree LSM] (log-structured merge) | * [https://en.wikipedia.org/wiki/Log-structured_merge-tree LSM] (log-structured merge) | ||
* [https://en.wikipedia.org/wiki/Cartesian_tree Cartesian] | * [https://en.wikipedia.org/wiki/Cartesian_tree Cartesian] | ||
* [https://en.wikipedia.org/wiki/Segment_tree segment] | |||
* [https://en.wikipedia.org/wiki/Interval_tree interval] | |||
==[[Compiler Design|Compiling]]== | ==[[Compiler Design|Compiling]]== | ||
* abstract syntax | * abstract syntax | ||
Revision as of 05:53, 8 March 2023
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
- maple
- top
- fat
- b / b+ / 2-3
- vEB (van Emde Boas)
- radix
- dancing
- splay
- trie
- up-sweep (Blelloch 1990)
- kd
- (minimal) spanning
- Gomory-Hu
- decision
- Hilbert R
- Fenwick
- game
- aa
- finger
- Trémaux
- Steiner
- Order statistic
- LSM (log-structured merge)
- Cartesian
- segment
- interval
Compiling
- abstract syntax
- doubly logarithmic
- dominator
...
Theory
- Finite/Pushdown Tree Automata
- Algebraic tree systems
