Dumbed down binary search tree, with only insert operation :)

dumb-bst.js

let tree = { root: { val: null, left: null,
    right: null
  }
};

const createEmptySubtree = () => ({ val: null, left: null, right: null });

const insert = (node, root) => {
  console.log(`node: ${node}, root: ${root}`);
  if (!root.val) {
    console.log("on root");
    root.val = node;
  } else if (node < root.val) {
    // go left
    if (!root.left) {
      root.left = createEmptySubtree();
    }
    insert(node, root.left);
  } else if (node > root.val) {
    // go right
    if (!root.right) {
      root.right = createEmptySubtree();
    }
    insert(node, root.right);
  }
};

insert(10, tree.root);
insert(50, tree.root);
insert(5, tree.root);
insert(29, tree.root);
console.log(tree);