Trees: Difference between revisions
No edit summary |
No edit summary |
||
| (15 intermediate revisions by the same user not shown) | |||
| Line 3: | Line 3: | ||
* AVL (Adelson-Velsky + Landis) | * AVL (Adelson-Velsky + Landis) | ||
* pq | * pq | ||
* [https://lwn.net/Articles/845507/ maple] | |||
* top | * top | ||
* fat | * fat | ||
| Line 11: | Line 12: | ||
* splay | * splay | ||
* trie | * trie | ||
* up-sweep (Blelloch 1990) | |||
* kd | * kd | ||
* (minimal) spanning | * (minimal) spanning | ||
* [[Gomory-Hu Tree|Gomory-Hu]] | |||
* decision | * decision | ||
* Hilbert R | |||
* Fenwick | |||
* game | * game | ||
* aa | * aa | ||
* finger | |||
* Trémaux | |||
* [https://en.wikipedia.org/wiki/Steiner_tree_problem Steiner] | |||
* Order statistic | |||
* [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/Segment_tree segment] | |||
* [https://en.wikipedia.org/wiki/Interval_tree interval] | |||
* prolly (variant of b-trees) | |||
==[[Compiler Design|Compiling]]== | ==[[Compiler Design|Compiling]]== | ||
* abstract syntax | * abstract syntax | ||
* doubly logarithmic | |||
* dominator | * dominator | ||
... | ... | ||
==Theory== | ==Theory== | ||
* Finite/Pushdown [[automata#Tree_automata|Tree Automata]] | * Finite/Pushdown [[automata#Tree_automata|Tree Automata]] | ||
* Algebraic tree systems | * Algebraic tree systems | ||