hxx/javascript-algorithms
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/trekhleb/javascript-algorithms.git synced 2024-12-25 22:46:20 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add binary search tree.

Browse Source
This commit is contained in:
Oleksii Trekhleb 2018-04-03 06:41:45 +03:00
parent 8caf3a2201
commit 873024079a
2 changed files with 17 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -9,7 +9,7 @@ export default class BinarySearchTreeNode extends BinaryTreeNode {
} else {
this.left = new BinarySearchTreeNode(value);
}
} else {
} else if (value > this.value) {
// Insert to the right.
if (this.right) {
this.right.insert(value);
@ -30,7 +30,7 @@ export default class BinarySearchTreeNode extends BinaryTreeNode {
if (value < this.value && this.left) {
// Check left nodes.
return this.left.contains(value);
} else if (this.right) {
} else if (value > this.value && this.right) {
// Check right nodes.
return this.right.contains(value);
}

15
src/data-structures/tree/binary-search-tree/__test__/BinarySearchTreeNode.test.js
View File

@ -41,4 +41,19 @@ describe('BinarySearchTreeNode', () => {
expect(bstNode.contains(6)).toBeTruthy();
expect(bstNode.contains(8)).toBeFalsy();
});
it('should not insert duplicates', () => {
const bstNode = new BinarySearchTreeNode(2);
bstNode.insert(1);
expect(bstNode.toString()).toBe('1,2');
expect(bstNode.contains(1)).toBeTruthy();
expect(bstNode.contains(3)).toBeFalsy();
bstNode.insert(1);
expect(bstNode.toString()).toBe('1,2');
expect(bstNode.contains(1)).toBeTruthy();
expect(bstNode.contains(3)).toBeFalsy();
});
});