daraxdray · November 6, 2022 18:59 · Mar 4, 2020 · Mar 4, 2020
diff --git a/binarySearchTree.js b/binarySearchTree.js
@@ -13,7 +13,6 @@ class BinarySearchTree {
   constructor() {
     this.root = null;
   }
-
   //inserts a number into the tree. Returns the entire tree.
   insert(value) {
     const newNode = new Node(value);
@@ -40,7 +39,6 @@ class BinarySearchTree {
       }
     }
   }
-
   //finds the given number and returns it. If its not found, returns `null` or `undefined`.
   find(value) {
     if (!this.root) return null;
@@ -56,7 +54,6 @@ class BinarySearchTree {
       }
     }
   }
-
   //checks if a given number exists in the tree. If its in the tree, returns `true`, otherwise `false`
   contains(value) {
     if (!this.root) return null;

diff --git a/binarySearchTree.js b/binarySearchTree.js
@@ -0,0 +1,94 @@
+// A binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child.
+// Left child is always less than it's parent and the right child is always bigger than it's parent.
+
+class Node {
+  constructor(value) {
+    this.value = value;
+    this.right = null;
+    this.left = null;
+  }
+}
+
+class BinarySearchTree {
+  constructor() {
+    this.root = null;
+  }
+
+  //inserts a number into the tree. Returns the entire tree.
+  insert(value) {
+    const newNode = new Node(value);
+    if (!this.root) {
+      this.root = newNode;
+      return this;
+    }
+    let current = this.root;
+    const rnLoop = true;
+    while (rnLoop) {
+      if (value === current.value) return undefined;
+      if (value < current.value) {
+        if (!current.left) {
+          current.left = newNode;
+          return this;
+        }
+        current = current.left;
+      } else {
+        if (!current.right) {
+          current.right = newNode;
+          return this;
+        }
+        current = current.right;
+      }
+    }
+  }
+
+  //finds the given number and returns it. If its not found, returns `null` or `undefined`.
+  find(value) {
+    if (!this.root) return null;
+    let current = this.root;
+    const rnLoop = true;
+    while (rnLoop) {
+      if (!current) return undefined;
+      if (value === current.value) return current;
+      if (value < current.value) {
+        current = current.left;
+      } else {
+        current = current.right;
+      }
+    }
+  }
+
+  //checks if a given number exists in the tree. If its in the tree, returns `true`, otherwise `false`
+  contains(value) {
+    if (!this.root) return null;
+    let current = this.root;
+    const rnLoop = true;
+    while (rnLoop) {
+      if (!current) return false;
+      if (value === current.value) return true;
+      if (value < current.value) {
+        current = current.left;
+      } else {
+        current = current.right;
+      }
+    }
+  }
+}
+
+
+
+
+//EXAMPLES==================================================================================
+
+const binarySearchTree = new BinarySearchTree();
+binarySearchTree.insert(10); //returns the entire list
+binarySearchTree.insert(6); //returns the entire list
+binarySearchTree.insert(2);
+binarySearchTree.insert(20);
+binarySearchTree.insert(34);
+binarySearchTree.insert(69);
+binarySearchTree.insert(4);
+binarySearchTree.find(4); //returns `Node {value: 2, right: Node, left: null}`
+binarySearchTree.find(20);
+binarySearchTree.find(123); //returns `undefined`
+binarySearchTree.contains(6); //returns `true`
+binarySearchTree.contains(123); //returns `false`