bst-example.js

// My own implementation of a BST


class binarySearchTree {
  constructor() {
  this.left = null;
  this.right = null;
  this.root = null;
  }
  
  insert() {
    // first check if root node is empty
    // then determine if new value is greater than or lesser than/equal to root
  }
  
  
}