Dustin Boston dustinboston

## bts.ts
/**
 * @file Binary Search Tree
 * @author Dustin Boston
 * @see Cormen, T, Leiserson, C, Rivest, R, and Stein, C. (2001).
 *   Introduction to Algorithms. (2nd ed). The MIT Press.
 */

/**
 * Represents a node in a binary search tree.
 *

## _index.html
<!DOCTYPE html>
<html lang="en">
  <head>
    <meta charset="UTF-8" />
    <meta name="viewport" content="width=device-width, initial-scale=1.0" />
    <meta http-equiv="X-UA-Compatible" content="ie=edge" />
    <title>Poor Man's React</title>
    <link rel="stylesheet" href="./css/styles.css" />
  </head>
  <body>

## fastest_fizzbuzz.js
var acc = 810092048;
var aMillion = 1000000;
var number = 1;
var log = function(value) {
  console.log(value);
};


function bitwiseFizzBuzz(i) {
  var c = acc & 3, a = 'fizzbuzz';
	/**
	* @file Binary Search Tree
	* @author Dustin Boston
	* @see Cormen, T, Leiserson, C, Rivest, R, and Stein, C. (2001).
	* Introduction to Algorithms. (2nd ed). The MIT Press.
	*/

	/**
	* Represents a node in a binary search tree.
	*
	<!DOCTYPE html>
	<html lang="en">
	<head>
	<meta charset="UTF-8" />
	<meta name="viewport" content="width=device-width, initial-scale=1.0" />
	<meta http-equiv="X-UA-Compatible" content="ie=edge" />
	<title>Poor Man's React</title>
	<link rel="stylesheet" href="./css/styles.css" />
	</head>
	<body>
	var acc = 810092048;
	var aMillion = 1000000;
	var number = 1;
	var log = function(value) {
	console.log(value);
	};


	function bitwiseFizzBuzz(i) {
	var c = acc & 3, a = 'fizzbuzz';