Finished benchmark and plotting

Lab2/bst/bst.h

@@ -1,3 +1,5 @@
+#include <vector>
+
 struct Tree {
   int info;
   Tree *left;
@@ -6,4 +8,7 @@ struct Tree {
 
 Tree *insert(Tree *root, int value);
 Tree *search(Tree *root, int value);
-void freeTree(Tree *root);
+void traverseInOrder(Tree *root,std::vector<int> &vec);
+Tree *rebuild(std::vector<int> *vec, int start, int end);
+Tree *balance(Tree *root);
+void deleteTree(Tree *root);