// Program that creates a binary search tree: each node has up to two children, and all left descendants of a node is less than or equal to the node and all right descendants are greater than the node

// create node
function Node(val) {
	this.value = val;
	this.left = null;
	this.right = null;
}

@@ -209,16 +209,22 @@
 ate node
+ class
 %0Afunctio
@@ -297,8 +297,105 @@
 null;%0A%7D%0A
+%0A// create constructor for binary search tree%0Afunction BinarySearchTree() %7B%0A%09this.root = null;%0A%7D%0A

Create constructor for binary search tree