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) n...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Book |
| Published: |
Academy of Cognitive and Natural Sciences,
2022-12-01T00:00:00Z.
|
| Subjects: | |
| Online Access: | Connect to this object online. |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Internet
Connect to this object online.3rd Floor Main Library
| Call Number: |
A1234.567 |
|---|---|
| Copy 1 | Available |