Difference between revisions of "Template:CS trees"
Jump to navigation
Jump to search
(Brodal queue is another type of heap (albeit impractical)) |
imported>HueSatLum m (MOS:DASH) |
||
(2 intermediate revisions by 2 users not shown) | |||
Line 20: | Line 20: | ||
*[[Interval tree|Interval]] | *[[Interval tree|Interval]] | ||
*[[Order statistic tree|Order statistic]] | *[[Order statistic tree|Order statistic]] | ||
− | *([[Left-leaning red–black tree|Left-leaning]]) [[Red–black tree| | + | *([[Left-leaning red–black tree|Left-leaning]]) [[Red–black tree|Red–black]] |
*[[Scapegoat tree|Scapegoat]] | *[[Scapegoat tree|Scapegoat]] | ||
*[[Splay tree|Splay]] | *[[Splay tree|Splay]] | ||
Line 48: | Line 48: | ||
*[[Pairing heap|Pairing]] | *[[Pairing heap|Pairing]] | ||
*[[Skew heap|Skew]] | *[[Skew heap|Skew]] | ||
− | *[[Van Emde Boas tree| | + | *[[Van Emde Boas tree|van Emde Boas]] |
*[[Weak heap|Weak]] | *[[Weak heap|Weak]] | ||
Line 93: | Line 93: | ||
}}<noinclude> | }}<noinclude> | ||
+ | {{doc|content= | ||
+ | {{NODOC}} | ||
+ | |||
[[Category:Computer science navigational boxes]] | [[Category:Computer science navigational boxes]] | ||
+ | }} | ||
</noinclude> | </noinclude> |
Latest revision as of 01:24, 18 September 2020
Editors can experiment in this template's sandbox (create | mirror) and testcases (create) pages. Subpages of this template. |