hxx/javascript-algorithms
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/trekhleb/javascript-algorithms.git synced 2024-11-14 06:52:59 +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 07:35:13 +03:00
parent ff2df770b8
commit c5bccffe36
4 changed files with 20 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
src/data-structures/tree/BinaryTreeNode.js
View File

@ -5,12 +5,12 @@ export default class BinaryTreeNode {
this.value = value; this.value = value;
} }
addLeft(node) { setLeft(node) {
this.left = node; this.left = node;
return this; return this;
} }
addRight(node) { setRight(node) {
this.right = node; this.right = node;
return this; return this;
} }

8
src/data-structures/tree/__test__/BinaryTreeNode.test.js
View File

@ -15,8 +15,8 @@ describe('BinaryTreeNode', () => {
const rootNode = new BinaryTreeNode(2); const rootNode = new BinaryTreeNode(2);
rootNode rootNode
.addLeft(leftNode) .setLeft(leftNode)
.addRight(rightNode); .setRight(rightNode);
expect(rootNode.value).toBe(2); expect(rootNode.value).toBe(2);
expect(rootNode.left.value).toBe(1); expect(rootNode.left.value).toBe(1);
@ -29,8 +29,8 @@ describe('BinaryTreeNode', () => {
const rootNode = new BinaryTreeNode(2); const rootNode = new BinaryTreeNode(2);
rootNode rootNode
.addLeft(leftNode) .setLeft(leftNode)
.addRight(rightNode); .setRight(rightNode);
expect(rootNode.traverseInOrder()).toEqual([1, 2, 3]); expect(rootNode.traverseInOrder()).toEqual([1, 2, 3]);

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

@ -2,6 +2,11 @@ import BinaryTreeNode from '../BinaryTreeNode';
export default class BinarySearchTreeNode extends BinaryTreeNode { export default class BinarySearchTreeNode extends BinaryTreeNode {
insert(value) { insert(value) {
if (this.value === null) {
this.value = value;
return this;
}
if (value < this.value) { if (value < this.value) {
// Insert to the left. // Insert to the left.
if (this.left) { if (this.left) {

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

@ -9,6 +9,15 @@ describe('BinarySearchTreeNode', () => {
expect(bstNode.right).toBeNull(); expect(bstNode.right).toBeNull();
}); });
it('should insert in itself if it is empty', () => {
const bstNode = new BinarySearchTreeNode();
bstNode.insert(1);
expect(bstNode.value).toBe(1);
expect(bstNode.left).toBeNull();
expect(bstNode.right).toBeNull();
});
it('should insert nodes in correct order', () => { it('should insert nodes in correct order', () => {
const bstNode = new BinarySearchTreeNode(2); const bstNode = new BinarySearchTreeNode(2);
bstNode.insert(1); bstNode.insert(1);