tip about method BinarySearchTree.replaceNodeWithNode()

[zzuklj]

java-algorithms-implementation/src/com/jwetherell/algorithms/data_structures/BinarySearchTree.java

Line 375 in 356dfb1

replacementParent.lesser = replacementNodeGreater;

this code is not wrong. I wonder can you modify it.
in my opinion, replacementNode must be a leaf node.
so if it is a left leaf node or a right leaf node,
just make sure replacementParent.lesser = null; or replacementParent.greater= null;