Binary Search Tree

binary-seach-tree.js

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

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

  insert(value) {
    let node = new Node(value)
    //is value the first then root
    if (this.root === null) {
      this.root = node
      return this
    }

    let currentNode = this.root
    while (true) {
      if (value < currentNode.value) {
        if (!currentNode.left) {
            currentNode.left = node
            return this
        }
        currentNode = currentNode.left
      }else {
        if (!currentNode.right) {
          currentNode.right = node
          return this
        }
        currentNode = currentNode.right
      }
    }
  }

  lookup(value) {

  }

  remove(value) {

  }

  bfs() {
    let currentNode = this.root
    let list = []
    let queue = []
    queue.push(currentNode)

    while(queue.length > 0)  {
      currentNode = queue.shift()
      if (currentNode.left) {
        queue.push(currentNode.left)
      }
      if (currentNode.right) {
        queue.push(currentNode.right)
      }
    }
    return list
  }
}

const tree = new BinarySearchTree()
tree.insert(9)
tree.insert(4)
tree.insert(6)
tree.insert(20)
tree.insert(170)
tree.insert(15)
tree.insert(1)
tree.insert(300)
tree.insert(99)
tree.insert(78)
// tree.bfs()
let log = JSON.stringify(traverse(tree.root))
console.log(log)

function traverse(node) {
  if (node && node.value) {
    const tree = {value: node.value}
    tree.left = node.leff === null ? null : traverse(node.left)
    tree.right = node.right === null ? null : traverse(node.right)
    return tree
  }
}