feat: updates README

README.md

@@ -2,6 +2,20 @@
 
 This repository was created to be used as reference for Binary Search Tree implementation using JavaScript.
 
+The Binary Search Tree class has the following methods:
+
+- **size**: _returns the size of the tree_
+- **insert**: _inserts a new node in the correct position_
+- **min**: _returns the min value of the BST_
+- **max**: _returns the max value of the BST_
+- **contains**: _checks if the value exists in the BST_
+- **dfsIterative**: _Depth First Search - Iterative_
+- **dfsInOrder**: _Depth First Search - Recursive - [left, root, right]_
+- **dfsPreOrder**: _Depth First Search - Recursive - [root, left, right]_
+- **dfsPostOrder**: _Depth First Search - Recursive - [left, right, root]_
+- **bfs**: _Breadth First Search - Recursive_
+- **invertTree**: _Inverts the BST_
+
 ## :rocket: How to run
 
 ```bash