From beaf1c43b911895660b6ea23fa6ad6d2a5c45c33 Mon Sep 17 00:00:00 2001 From: Eyas Ranjous Date: Sun, 15 Jul 2018 18:18:46 -0500 Subject: [PATCH 1/3] readme --- README.md | 5 +---- 1 file changed, 1 insertion(+), 4 deletions(-) diff --git a/README.md b/README.md index fab13c7..fd9635a 100644 --- a/README.md +++ b/README.md @@ -166,10 +166,7 @@ bst.traverse(node => console.log(node.getValue()), 'preOrder'); removes a value's node (if exists) from the tree. ```javascript 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()** From 1a67f79aecfe8c887a754a70f338d6a0b89752e0 Mon Sep 17 00:00:00 2001 From: Eyas Ranjous Date: Sun, 15 Jul 2018 18:20:40 -0500 Subject: [PATCH 2/3] readme --- README.md | 1 + 1 file changed, 1 insertion(+) diff --git a/README.md b/README.md index fd9635a..9704078 100644 --- a/README.md +++ b/README.md @@ -165,6 +165,7 @@ 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); console.log(bst.find(30)); // null ``` From e0147098c76f77ed2f4d462b29470eba0811efcb Mon Sep 17 00:00:00 2001 From: Eyas Ranjous Date: Sun, 15 Jul 2018 18:20:58 -0500 Subject: [PATCH 3/3] v1.0.7 --- package.json | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/package.json b/package.json index f4dcae9..cf8fbfc 100644 --- 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": {