Added basic insert and find methods to binary search tree
Outlined the details of a binary heap
min, getChildren and getParent functions of the binary heap
Added insert operation
Added the removeMin operation to the heap
Update to getChildren that only returns an array of results if there are children
A hotfix to removeMin that works whether or not there are children node(s)
Finished the basic implementation of binary heap
Added mixin functionality to binary heap for min/max operations
Updated for operation as a node module
Tests for the heap data structure
Super basic gruntfile for testing on the server side with Mocha
Hotfix for sibTree tests and implementation
Client-side testing update for heap data structure
Git is convinced something in my package file has been updated
Updates to the binary search tree (still a work-in-progress) to make it compatible to test as a node module