Binary Search Tree (Ordered Map)

bst.js

class BST {
  constructor(key, value, parent) {
    this.key = key || null;
    this.value = value || null;
    this.parent = parent || null;
    this.left = null;
    this.right = null;
  }
  
  insert(key, value, parent) {
    if (this.key === null) {
      this.key = key;
      this.value = value;
    } 
    else if (key < this.key) {
      if (this.left === null) {
        this.left = new BST(key, value, this);
      } else {
        this.left.insert(key, value);
        }
    }
    else {
      if (this.right === null) {
        this.right = new BST(key, value, this);
      } 
      else {
        this.right.insert(key, value);
      }
    }
  }
  
  get(key) {
    if (this.key === key) { return this.value }
    else if (key < this.key && this.left) {
      return this.left.get(key);
    }
    else if (key > this.key && this.right) {
      return this.right.get(key);
    }
  }
  
}