Built out basic functionality for rebalance.
Need to remove comments eventually.
Need to return existing tree rather than new tree.
Correctly mutates existing tree rather than returning a new one.
Switched to using breadth first log for initial traversal.
Removed all comments from code.
Matched repository formatting.
Mutates existing tree rather than returning new tree.
Adds test spec, which passes using gulp mocha.
Merge branch 'master' of https://github.com/DSLibrary/dslib
Updates previous commit/pull request with the following:
-Adds count, height properties to new binary search tree instances.
-Updates insert method to check whether it should automatically rebalance upon each new node insertion.
-Updates rebalance method to operate in slightly different order to avoid infinite loops when rebuilding the tree (rebalance was being called and causing an infinite loop, as the entire left side of the tree was being built before the right side was started in the previous version).
-Updates tests to test that the rebalance function exists and that it is properly called when max height becomes greater than two times min height.
Merge pull request #5 from JonathanWarrick/master

Adds functionality for Binary Search Tree rebalance.
Updates README.md to reflect changes made to Binary Search Tree.
refactor binarySearch contains
Merge pull request #8 from JonathanWarrick/master

Updates README.md to reflect changes made to Binary Search Tree.
Merge pull request #9 from smk1992/refactor/contains

refactor binarySearch contains
[FEAT] Update stack tests
[DOC] Update version
[DOC] Update backlog
[FEAT] dynamic dataStructure addition
Merge pull request #10 from wlabranche/dynamic-addition

[FEAT] dynamic data structure addition
Implement SetStrict with tests
[FEAT] Implement map data structure
added union, intersection, difference, toArray, fromArray, and copy methods to set.  changed set init to use Object.create(null)
add Trie constructor and basic functions
add initial tests for trie