Update bst.h

Author: aim97

bst.h

@@ -50,61 +50,62 @@ class bst{
  * 2 - methods
  * ==================
  * 1 - containsKey(T1): this method takes value of type T1 and returns if that value occurs in the tree as a key or not
- * 						parameters  : k:<T1>
- * 						return type : bool
- * 						excpetions  : none
+ * 		parameters  : k:<T1>
+ * 		return type : bool
+ * 		excpetions  : none
  * 
  * 2 - lookup(T1)     : this method takes a key and returns the value associated with it, raising an exception if key not found
- * 						parameters  : k:<T1>
- * 						return type : v:<T2>
- *                      excpetions  : "key not found"
+ * 		parameters  : k:<T1>
+ * 		return type : v:<T2>
+ *              excpetions  : "key not found"
  * 
  * 3 - modify(T1, T2) : changes that value associated with the given key of type T1 (1st argument) to the given value of type T2 (2nd argument)
- * 						parameters  : k:<T1> , v:<T2>
- * 	                    return type : void 
- *                      exceptions  : "key not found"
+ * 		parameters  : k:<T1> , v:<T2>
+ * 	        return type : void 
+ *              exceptions  : "key not found"
  * 
  * 4 - display()      : this one displays the tree in preorder left-root-right as [[left], rootkey : "rootValue" , [right]]
- * 						parameters  : none
- * 						return type : void
- *                      exceptions  : none
+ * 		parameters  : none
+ * 		return type : void
+ *              exceptions  : none
  * 
  * static methods
  * =================
  * 1 - insert() : 
- * 		inserts a new key value pair of the given two values such that 1st parameter is key and 2nd one is value
+ * 	inserts a new key value pair of the given two values such that 1st parameter is key and 2nd one is value
  * 		parameters  : node:<bst<T1, T2>* > , k:<T1> , v:<T2>
- * 	    return type : bst<T1, T2>*
- *      exceptions  : "key already exists"
+ * 		return type : bst<T1, T2>*
+ * 	        exceptions  : "key already exists"
  * 
  * 2 - set()      : 
  *      changes that value associated with the given key of type T1 (1st argument) to the given value of type T2 (2nd argument) 
  *      if key not found make it
  * 		parameters  : node <bst<T1, T2>* >, k:<T1> , v:<T2>
  * 		return type : bst<T1, T2>*
- *      excpetions  : none
+ *      	excpetions  : none
  * 
  * 
- * 3 - rotateLeft()   : does the left rotation operation on the given subtree
- * 				        parameters  : node:<bst<T1, T2> >
- *                      return type : bst<T1, T2>*
- * 					    excpetions  : none
+ * 3 - rotateLeft()   : 
+ * 	does the left rotation operation on the given subtree
+ * 		parameters  : node:<bst<T1, T2> >
+ *              return type : bst<T1, T2>*
+ * 		excpetions  : none
  * 
- * 4 - rotateRight()  : does the right rotation operation on the given subtree
- * 				        parameters  : node:<bst<T1, T2> >
- *                      return type : bst<T1, T2>*
- * 					    excpetions  : none
+ * 4 - rotateRight()  : 
+ *	does the right rotation operation on the given subtree
+ * 		parameters  : node:<bst<T1, T2> >
+ *              return type : bst<T1, T2>*
+ * 		excpetions  : none
  * 
- * 5 - lvl()          : returns the height of the subtree given to it
- *                      parameters  : node:<bst<T1, T2>* >
- *                      retunn type : int 
- *                      exceptions  : none
+ * 5 - lvl()          : 
+ *	returns the height of the subtree given to it
+ *              parameters  : node:<bst<T1, T2>* >
+ *              retunn type : int 
+ *              exceptions  : none
  * possible updates
  * =================
  * 1 - erase(T1)      : erases the node with given key
- * 						parameters  : k:<T1>
- * 						return type : void
- *                      exceptions  : "key not found"
- * 
- * 
+ * 		parameters  : k:<T1>
+ * 		return type : void
+ *              exceptions  : "key not found"
  * */