diff --git a/README.md b/README.md
index 9704078..9a40bc1 100644
--- a/README.md
+++ b/README.md
@@ -21,9 +21,9 @@ const bst = binarySearchTree();
 creates a bst node.
 
 * **.setValue(value)** sets the node's value.
-* **.getValue(value)** gets the node's value.
+* **.getValue()** gets the node's value.
 * **.setParent(parent)** sets the parent node.
-* **.getParent(parent)** gets the parent node.
+* **.getParent()** gets the parent node.
 * **.setLeft(left)** sets the node's left child.
 * **.getLeft()** gets the node's left child.
 * **.setRight(right)** sets the node's right child.
diff --git a/package.json b/package.json
index cf8fbfc..3173841 100644
--- a/package.json
+++ b/package.json
@@ -1,6 +1,6 @@
 {
   "name": "@datastructures-js/binary-search-tree",
-  "version": "1.0.7",
+  "version": "1.0.8",
   "description": "binary search tree implementation in javascript",
   "main": "index.js",
   "scripts": {