ðŸŽ‰ Exercism Research is now launched. Help Exercism, help science and have some fun at research.exercism.io ðŸŽ‰

btwooton's solution

to Binary Search Tree in the JavaScript Track

Published at Nov 12 2020 · 0 comments
Instructions
Test suite
Solution

Note:

This exercise has changed since this solution was written.

Insert and search for numbers in a binary tree.

When we need to represent sorted data, an array does not make a good data structure.

Say we have the array `[1, 3, 4, 5]`, and we add 2 to it so it becomes `[1, 3, 4, 5, 2]` now we must sort the entire array again! We can improve on this by realizing that we only need to make space for the new item `[1, nil, 3, 4, 5]`, and then adding the item in the space we added. But this still requires us to shift many elements down by one.

Binary Search Trees, however, can operate on sorted data much more efficiently.

A binary search tree consists of a series of connected nodes. Each node contains a piece of data (e.g. the number 3), a variable named `left`, and a variable named `right`. The `left` and `right` variables point at `nil`, or other nodes. Since these other nodes in turn have other nodes beneath them, we say that the left and right variables are pointing at subtrees. All data in the left subtree is less than or equal to the current node's data, and all data in the right subtree is greater than the current node's data.

For example, if we had a node containing the data 4, and we added the data 2, our tree would look like this:

``````  4
/
2
``````

If we then added 6, it would look like this:

``````  4
/ \
2   6
``````

If we then added 3, it would look like this

``````   4
/   \
2     6
\
3
``````

And if we then added 1, 5, and 7, it would look like this

``````      4
/   \
/     \
2       6
/ \     / \
1   3   5   7
``````

Setup

Go through the setup instructions for Javascript to install the necessary dependencies:

https://exercism.io/tracks/javascript/installation

Requirements

Please `cd` into exercise directory before running all below commands.

Install assignment dependencies:

``````\$ npm install
``````

Making the test suite pass

Execute the tests with:

``````\$ npm test
``````

In the test suites all tests but the first have been skipped.

Once you get a test passing, you can enable the next one by changing `xtest` to `test`.

Submitting Solutions

Once you have a solution ready, you can submit it using:

``````exercism submit binary-search-tree.js
``````

Submitting Incomplete Solutions

It's possible to submit an incomplete solution so you can see how others have completed the exercise.

Exercise Source Credits

binary-search-tree.spec.js

``````import { BinarySearchTree } from './binary-search-tree';

function recordAllData(bst) {
const out = [];

bst.each(data => out.push(data));

return out;
}

describe('BinarySearchTree', () => {
test('data is retained', () => {
expect(new BinarySearchTree(4).data).toEqual(4);
});

xtest('inserting less', () => {
const four = new BinarySearchTree(4);
four.insert(2);

expect(four.data).toEqual(4);
expect(four.left.data).toEqual(2);
});

xtest('inserting same', () => {
const four = new BinarySearchTree(4);
four.insert(4);

expect(four.data).toEqual(4);
expect(four.left.data).toEqual(4);
});

xtest('inserting right', () => {
const four = new BinarySearchTree(4);
four.insert(5);

expect(four.data).toEqual(4);
expect(four.right.data).toEqual(5);
});

xtest('complex tree', () => {
const four = new BinarySearchTree(4);
four.insert(2);
four.insert(6);
four.insert(1);
four.insert(3);
four.insert(7);
four.insert(5);

expect(four.data).toEqual(4);
expect(four.left.data).toEqual(2);
expect(four.left.left.data).toEqual(1);
expect(four.left.right.data).toEqual(3);
expect(four.right.data).toEqual(6);
expect(four.right.left.data).toEqual(5);
expect(four.right.right.data).toEqual(7);
});

xtest('iterating one element', () => {
expect(recordAllData(new BinarySearchTree(4))).toEqual([4]);
});

xtest('iterating over smaller element', () => {
const four = new BinarySearchTree(4);
four.insert(2);

expect(recordAllData(four)).toEqual([2, 4]);
});

xtest('iterating over larger element', () => {
const four = new BinarySearchTree(4);
four.insert(5);

expect(recordAllData(four)).toEqual([4, 5]);
});

xtest('iterating over complex tree', () => {
const four = new BinarySearchTree(4);
four.insert(2);
four.insert(1);
four.insert(3);
four.insert(6);
four.insert(7);
four.insert(5);

expect(recordAllData(four)).toEqual([1, 2, 3, 4, 5, 6, 7]);
});
});``````
``````export class BinarySearchTree {
constructor(data, left, right) {
this.data = data;
this.left = left;
this.right = right;
}

insert(data) {
if (data <= this.data) {
if (!this.left) {
this.left = new BinarySearchTree(data, null, null);
} else {
this.left.insert(data);
}
} else {
if (!this.right) {
this.right = new BinarySearchTree(data, null, null);
} else {
this.right.insert(data);
}
}
}

each(callback) {
this.left && this.left.each(callback);
callback(this.data);
this.right && this.right.each(callback);

}
}``````

What can you learn from this solution?

A huge amount can be learned from reading other peopleâ€™s code. This is why we wanted to give exercism users the option of making their solutions public.

Here are some questions to help you reflect on this solution and learn the most from it.

• What compromises have been made?