From 1f895188dc8ba8a7acf7b00dade2a72eac5edd89 Mon Sep 17 00:00:00 2001
From: Eyas Ranjous <eyas.ranjous@gmail.com>
Date: Fri, 26 Apr 2019 17:01:27 -0500
Subject: [PATCH 1/2] typo

---
 README.md | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/README.md b/README.md
index c38bad6..c5a489a 100644
--- a/README.md
+++ b/README.md
@@ -170,9 +170,9 @@ bst.traverse(node => console.log(node.getKey()), 'preOrder');
 ```
 
 
-### .remove(value)
+### .remove(key)
 
-removes a value's node (if exists) from the tree.
+removes a node by its key (if exists) from the tree.
 ```javascript
 console.log(bst.search(30).getKey()); // 30
 bst.remove(30);

From 75db0c6f8504c8750ec3356d65885805869be5a4 Mon Sep 17 00:00:00 2001
From: Eyas Ranjous <eyas.ranjous@gmail.com>
Date: Fri, 26 Apr 2019 17:01:48 -0500
Subject: [PATCH 2/2] v2.0.1

---
 package.json | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/package.json b/package.json
index b1576e1..824515b 100644
--- a/package.json
+++ b/package.json
@@ -1,6 +1,6 @@
 {
   "name": "@datastructures-js/binary-search-tree",
-  "version": "2.0.0",
+  "version": "2.0.1",
   "description": "binary search tree implementation in javascript",
   "main": "index.js",
   "scripts": {