Binary Search Tree Implementation

binary-tree-oop.js

class Node {
  constructor(value, left = null, right = null) {
    this.value = value;
    this.left = left;
    this.right = right;
  }
}

class BinarySearchTree {
  constructor() {
    this.root = null;
  }

  _addNode(node, value) {
    if (value < node.value) {
      if (!node.left) return (node.left = new Node(value));

      return this._addNode(node.left, value);
    } else if (value > node.value) {
      if (!node.right) return (node.right = new Node(value));

      return this._addNode(node.right, value);
    }
  }

  insert(value) {
    const node = this.root;

    if (!node) {
      this.root = new Node(value);
      return this.root;
    }

    return this._addNode(node, value);
  }

  _findNode(node, value) {
    if (node.value === value) return node;

    if (value < node.value) return this._findNode(node.left, value);

    if (value > node.value) return this._findNode(node.right, value);
  }

  get(value) {
    if (!this.root) return;

    if (this.root.value === value) return this.root;

    return this._findNode(this.root, value);
  }
}