Implementing Red-Black Tree in Go — Part 2: The Delete Operationby@dmitriiantonov90

Implementing Red-Black Tree in Go — Part 2: The Delete Operation

tldt arrow
Read on Terminal Reader
Read this story w/o Javascript

Too Long; Didn't Read

We figured out how the search and insert operation works in the red-black tree in the first part. In this part, we figure out the delete operation. The delete operation is more complicated than the insert operation. We must keep the original color of the deleted node. If the node to be deleted has two children, it is necessary to find a successor of this node.
featured image - Implementing Red-Black Tree in Go — Part 2: The Delete Operation
red and black tree via HackerNoon AI Image Generator
Dmitrii Antonov HackerNoon profile picture

@dmitriiantonov90

Dmitrii Antonov

I'm a software engineer with 7 years of experience. I enjoy data structure, graph theory, and distributed systems.


Receive Stories from @dmitriiantonov90

react to story with heart
Dmitrii Antonov HackerNoon profile picture
by Dmitrii Antonov @dmitriiantonov90.I'm a software engineer with 7 years of experience. I enjoy data structure, graph theory, and distributed systems.
Read my stories

RELATED STORIES

L O A D I N G
. . . comments & more!