c4x1

'use strict';

/*
 * Binary search tree with in-order iteration.
 * http://greim.github.io/gen/dist/00-intro.html
 */

class Tree {
  add(value) {
    if (this.root) this.root.add(value);

c4x1

'use strict';

function BinarySearchTree() {
  this.root = null;
}

BinarySearchTree.prototype.insertNode = function (val) {
  var node = {
    data : val, 

c4x1

'use strict';

class Node {
  constructor(data) {
    this.data = data;
    this.left = undefined;
    this.right = undefined;
  }

c4x1

#!/usr/bin/env node

const NKEYS = 4;

function arrayOfSize(size) {
    var a = Array(size);

    for (var i = 0; i < size; i += 1)
        a[i] = null;