benawad

function hashStringToInt(s, tableSize) {
  let hash = 17;

  for (let i = 0; i < s.length; i++) {
    hash = (13 * hash * s.charCodeAt(i)) % tableSize;
  }

  return hash;
}

nickangtc

/**
 * Read the original blog post for a detailed explanation!
 * http://www.nickang.com/linked-list-explained-part-1/
 * http://www.nickang.com/linked-list-implementation-part-2/
 */

/**
 * Constructor functions
 */

rodrwan

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

class Tree {
  constructor () {

rebeccapeltz

'use strict';
//https://gist.github.com/alexhawkins/f993569424789f3be5db
//http: //stackoverflow.com/questions/1331289/javascript-binary-search-tree-implementation


function BinarySearchTree(value) {
  this.value = value;
  this.left = null;
  this.right = null;
}