bst

exercises/bst/index.js

@@ -0,0 +1,13 @@
+// --- Directions
+// 1) Implement the Node class to create
+// a binary search tree.  The constructor
+// should initialize values 'data', 'left',
+// and 'right'.
+// 2) Implement the 'insert' method for the
+// Node class.  Insert should accept an argument
+// 'data', then create an insert a new node
+// at the appropriate location in the tree.
+
+class Node {}
+
+module.exports = Node;

exercises/bst/test.js

@@ -0,0 +1,16 @@
+const Node = require('./index');
+
+test('Node is a constructor', () => {
+  expect(typeof Node.prototype.constructor).toEqual('function');
+});
+
+test('Node can insert correctly', () => {
+  const node = new Node(10);
+  node.insert(5);
+  node.insert(15);
+  node.insert(17);
+
+  expect(node.left.data).toEqual(5);
+  expect(node.right.data).toEqual(15);
+  expect(node.right.right.data).toEqual(17);
+});