Merge pull request #8 from datastructures-js/development

eyas-ranjous · web-flow · commit 0616da5427d7 · 2018-07-15T18:21:23.000-05:00
v1.0.7
diff --git a/README.md b/README.md
@@ -165,11 +165,9 @@ bst.traverse(node => console.log(node.getValue()), 'preOrder');
 
 removes a value's node (if exists) from the tree.
 ```javascript
+console.log(bst.find(30).getValue()); // 30
 bst.remove(30);
-let n50 = bst.find(50);
-let n40 = bst.find(40);
-console.log(n50.getLeft().getValue()); // 40
-console.log(n40.getLeft().getValue()); // 20
+console.log(bst.find(30)); // null
 ```
 
 **.clear()** 
diff --git a/package.json b/package.json
@@ -1,6 +1,6 @@
 {
   "name": "@datastructures-js/binary-search-tree",
-  "version": "1.0.6",
+  "version": "1.0.7",
   "description": "binary search tree implementation in javascript",
   "main": "index.js",
   "scripts": {

Original file line number	Diff line number	Diff line change
`@@ -1,6 +1,6 @@`
`1`	`1`	`{`
`2`	`2`	`"name": "@datastructures-js/binary-search-tree",`
`3`		`- "version": "1.0.6",`
	`3`	`+ "version": "1.0.7",`
`4`	`4`	`"description": "binary search tree implementation in javascript",`
`5`	`5`	`"main": "index.js",`
`6`	`6`	`"scripts": {`