phishman3579/java-algorithms-implementation

Binary Search Tree rotateRight() duplicates the nodes after rotation

Opened this issue · 1 comments

Deleted user commented 
    node.lesser = greater;
    if (greater != null)
        greater.parent = node;

greater node is already node.greater.
By above assignment, the greater is now assigned to both node.lesser and node.greater

phishman3579 commented

@infiniteloop112 Actually, I see what you are saying but on line number 165 I am setting node.greater to NULL.

Node<T> greater = node.greater;
node.greater = null;