Abstract
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) node is formed, thus, causing a reduction in black heights and the tree becomes unbalanced. Rebalancing a RB tree with a DB node is a fairly complex process. Teaching and learning the removal of DB nodes is also challenging. This paper introduces a simplified novel method which is a symbolic-algebraic arithmetic procedure for the removal of DB nodes and the rebalancing of black heights in RB trees. This simplified approach has enhanced student learning of the DB node removal in RB trees. Feedback from students showed the learnability, workability and acceptance of the symbolic-algebraic method in balancing RB trees after a delete operation.
Publisher
Kryvyi Rih State Pedagogical University
Reference25 articles.
1. Besa, J., Eterovic, Y.: A concurrent red–black tree. Journal of Parallel and Distributed Computing 73(4), 434–449 (2013), ISSN 0743-7315, https://doi.org/10.1016/j.jpdc.2012.12.010
2. Bounif, L., Zegour, D.E.: A revisited representation of the red-black tree. International Journal of Computer Aided Engineering and Technology 16(1), 95–118 (2022), https://doi.org/10.1504/IJCAET.2022.119541
3. Fredriksson, E.: Reducing CPU scheduler latency in Linux. Bachelor thesis, Umeå University (2022), URL http://www.diva-portal.se/smash/get/diva2:1630380/FULLTEXT01.pdf
4. Galles, D.: Red Black Tree Visualization (2011), URL https://www.cs.usfca.edu/∼galles/visualization/RedBlack.html
5. Germane, K., Might, M.: Deletion: The curse of the red-black tree. Journal of Functional Programming 24(4), 423–433 (2014), https://doi.org/10.1017/S0956796814000227