Vectormike

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

// Binary Search tree class

Vectormike

// Binary Search tree class

class BinarySearchTree {
    constructor() {
        // root of a binary search tree
        this.root = null;
    }
}

Vectormike

class Node {
  constructor(data) {
    this.data = data;
    this.leftChild = null;
    this.rightChild = null;
  }
}

Vectormike

if root === null 
  return null
if value === root -> data
  return data 
if value < root -> data
  return search(leftTree)
if value > root -> data
  return search(rightTree)

Vectormike

V = {A, B, C, D, E} 
E = {(AB), (AC), (AD), (BD), (BE), (CD), (DE)}
G = {V, E}

Vectormike

class HashTable {
  constructor(size) {
    this.table = new Array(size);
  }

  hashFunction(value) {
    let hash = 0;
    for (let i = 0; i < value.length; i++) {
      hash = (hash + value.charCodeAt(i) * i) % this.table.length;
    }

Vectormike

const hashTable = new HashTable(4);
hashTable.set('Victor', 24)

// [ <1 empty item>, [ [ 'Victor', 24 ] ], <2 empty items> ]

Vectormike

class HashTable {
  constructor(size) {
    this.table = new Array(size);
  }

  hashFunction(value) {
    let hash = 0;
    for (let i = 0; i < value.length; i++) {
      hash = (hash + value.charCodeAt(i) * i) % this.table.length;
    }

Vectormike

const hashTable = new HashTable(4);
hashTable.hashFunction('Hey')

// 3

Vectormike

class HashTable {
  constructor(size) {
    this.data = new Array(size);
  }

  hashFunction(value) {
    let hash = 0;
    for (let i = 0; i < value.length; i++) {
      hash = (hash + value.charCodeAt(i) * i) % this.data.length;
      console.log(hash);