Revisiting 2-3 red-black trees with a pedagogically sound yet efficient deletion algorithm: parity-seeking (Q6592108)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Revisiting 2-3 red-black trees with a pedagogically sound yet efficient deletion algorithm: parity-seeking |
scientific article; zbMATH DE number 7900820
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Revisiting 2-3 red-black trees with a pedagogically sound yet efficient deletion algorithm: parity-seeking |
scientific article; zbMATH DE number 7900820 |
Statements
Revisiting 2-3 red-black trees with a pedagogically sound yet efficient deletion algorithm: parity-seeking (English)
0 references
24 August 2024
0 references
