Example of use the binary tree data structure with JavaScript

binary-tree-data-structure.js

const tree = {}

function add(tree, value) {
  if (tree.value) {
    if (value > tree.value) {
      add(tree.right, value)
    } else {
      add(tree.left, value)
    }
  } else {
    tree.value = value
    tree.right = {}
    tree.left = {}
  }
}

console.log("Init Tree", tree)

add(tree, 10)
console.log("Tree Inserted #1", tree)

add(tree, 11)
console.log("Tree Inserted #2", tree)

add(tree, 9)
console.log("Tree Inserted #3", tree)
/*
OUTPUT:
Tree Inserted #3
{
  value:10,
  right: {
    value:11,
    right:(0) {...},
    left:(0) {...}
  },
  left: {
    value:9,
    right:(0) {...},
    left:(0) {...}
  }
}
*/