Red Black Tree algorithm

[Few Lines Of Code]

Brief Intro

Seemingly redundant action in delete(node z: RBNode) method.

More Details

Seems like there is no need in these lines. Also the CRLS implementation doesn't have it if I'm not wrong (lines 444-446)

if nodeY != z {
     z.key = nodeY.key
}