algorithm/javascript-algorithms
1
0
Fork 0
mirror of https://github.com/trekhleb/javascript-algorithms.git synced 2026-03-13 08:51:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add setValue and nodeCopy methods to binary tree node.

Browse Source
This commit is contained in:
Oleksii Trekhleb
2018-06-22 08:22:12 +03:00
parent bd5a16be71
commit 2334583635
3 changed files with 69 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
src/data-structures/tree/binary-search-tree/BinarySearchTreeNode.js
View File

@@ -99,7 +99,7 @@ export default class BinarySearchTreeNode extends BinaryTreeNode {
parent.removeChild(nodeToRemove);
} else {
// Node has no parent. Just erase current node value.
nodeToRemove.value = null;
nodeToRemove.setValue(undefined);
}
} else if (nodeToRemove.left && nodeToRemove.right) {
// Node has two children.
@@ -108,20 +108,24 @@ export default class BinarySearchTreeNode extends BinaryTreeNode {
const nextBiggerNode = nodeToRemove.right.findMin();
if (!this.nodeComparator.equal(nextBiggerNode, nodeToRemove.right)) {
this.remove(nextBiggerNode.value);
nodeToRemove.value = nextBiggerNode.value;
nodeToRemove.setValue(nextBiggerNode.value);
} else {
// In case if next right value is the next bigger one and it doesn't have left child
// then just replace node that is going to be deleted with the right node.
nodeToRemove.value = nodeToRemove.right.value;
nodeToRemove.right = nodeToRemove.right.right;
nodeToRemove.setValue(nodeToRemove.right.value);
nodeToRemove.setRight(nodeToRemove.right.right);
}
} else {
// Node has only one child.
// Make this child to be a direct child of current node's parent.
const child = nodeToRemove.left || nodeToRemove.right;
nodeToRemove.value = child.value;
nodeToRemove.setLeft(child.left);
nodeToRemove.setRight(child.right);
/** @var BinarySearchTreeNode */
const childNode = nodeToRemove.left || nodeToRemove.right;
if (parent) {
parent.replaceChild(nodeToRemove, childNode);
} else {
BinaryTreeNode.copyNode(childNode, nodeToRemove);
}
}
return true;