A symbolic-arithmetic for teaching double-black node removal in red-black trees
A red-black (RB) tree is a data structure with red and black nodes coloration. The red and black color of nodes make up the principal component for balancing a RB tree. A balanced tree has an equal number of black nodes on any simple path. But when a black leaf node is deleted, a double-black (DB)...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | deu |
| Published: |
Academy of Cognitive and Natural Sciences
2022-12-01
|
| Series: | Освітній вимір |
| Subjects: | |
| Online Access: | https://acnsci.org/journal/index.php/ed/article/view/530 |