BST init 👗

Author: deadcoder0904

examples/datastructures/bst.js

@@ -0,0 +1,60 @@
+class Node {
+	constructor(data, left, right) {
+		this.data = this.data;
+		this.left = this.left;
+		this.right = this.right;
+	}
+
+	show() {
+		return this.data;
+	}
+}
+
+class BST {
+	constructor() {
+		this.root = null;
+	}
+
+	insert(data) {
+		const node = new Node(data,null,null);
+		const temp = this.root;
+		if(temp == null) {
+			temp = node;
+			return;
+		}
+		while(data < temp.data)
+			temp = temp.left;
+		while(data > temp.data)
+			temp = temp.right;
+		if(data < temp.data)
+			temp.left = node;
+		else temp.right = node;
+	}
+
+	inorder(node) {
+		if(node != null) {
+			inorder(node.left);
+			putstr(node.show() + " ");
+			inorder(node.right);
+		}
+	}
+
+	preorder(node) {
+		if(node != null) {
+			putstr(node.show() + " ");
+			inorder(node.left);
+			inorder(node.right);
+		}
+	}
+
+	postorder(node) {
+		if(node != null) {
+			inorder(node.left);
+			inorder(node.right);
+			putstr(node.show() + " ");
+		}
+	}
+
+}
+
+module.exports = BST;

test/datastructures/bst.test.js

@@ -0,0 +1,27 @@
+const expect = require('chai').expect;
+const BST = require('../../examples/datastructures/bst');
+
+describe('=> DICTIONARY', function() {
+	let numbers;
+	before(function () {
+		numbers = new BST();
+	});
+
+	it('should create an Empty BST', function(done) {
+		expect(numbers.root).to.equal(null);
+		done();
+	});
+
+	it('should insert Nodes in the BST', function(done) {
+		numbers.insert(23);
+		numbers.insert(45);
+		numbers.insert(16);
+		numbers.insert(37);
+		numbers.insert(3);
+		numbers.insert(99);
+		numbers.insert(22);
+		expect(numbers.inorder(numbers.root)).to.equal("3 16 22 23 37 45 99");
+		done();
+	});
+
+});