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

Make it possible to insert meta information to bst node.

Browse Source
This commit is contained in:
Oleksii Trekhleb
2018-05-31 07:16:35 +03:00
parent 33ac110cce
commit 02d7abcf65
4 changed files with 33 additions and 12 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -3,11 +3,12 @@ import Comparator from '../../../utils/comparator/Comparator';
export default class BinarySearchTreeNode extends BinaryTreeNode {
/**
* @param {*} [value]
* @param {function} [compareFunction]
* @param {*} [value] - node value.
* @param {Object} [meta] - any meta information that is attached to the node.
* @param {function} [compareFunction] - comparator function for node values.
*/
constructor(value = null, compareFunction = undefined) {
super(value);
constructor(value = null, meta = null, compareFunction = undefined) {
super(value, meta);
// This comparator is used to compare node values with each other.
this.compareFunction = compareFunction;
@@ -16,27 +17,30 @@ export default class BinarySearchTreeNode extends BinaryTreeNode {
/**
* @param {*} value
* @param {Object} [meta]
* @return {BinarySearchTreeNode}
*/
insert(value) {
insert(value, meta = null) {
if (this.nodeValueComparator.equal(this.value, null)) {
this.value = value;
this.meta = meta;
return this;
}
if (this.nodeValueComparator.lessThan(value, this.value)) {
// Insert to the left.
if (this.left) {
this.left.insert(value);
this.left.insert(value, meta);
} else {
this.setLeft(new BinarySearchTreeNode(value, this.compareFunction));
this.setLeft(new BinarySearchTreeNode(value, meta, this.compareFunction));
}
} else if (this.nodeValueComparator.greaterThan(value, this.value)) {
// Insert to the right.
if (this.right) {
this.right.insert(value);
this.right.insert(value, meta);
} else {
this.setRight(new BinarySearchTreeNode(value, this.compareFunction));
this.setRight(new BinarySearchTreeNode(value, meta, this.compareFunction));
}
}