Created a binary search tree with a balancing functionality. Uses the AVL algorithm to implement tree balancing. We also wrote test that checks the algorithm. We create(by insert) general unbalanced tree, a left only balanced tree and a right only balanced tree. We test if resulting tree is balanced. We use pre_order tranversing method.
Merge pull request #17 from im-auld/hashtable

Created a binary search tree with a balancing functionality. Uses the AV...