We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent b1654ab commit 20c9612Copy full SHA for 20c9612
README.md
@@ -39,8 +39,8 @@ var tree = new BinarySearchTree(function(key1, key2) {
39
});
40
41
// Setting data
42
-tree.set('key1', 'data1');
43
-tree.set('key2', 'data2');
+tree.set('key1', 'data1')
+ .set('key2', 'data2');
44
45
// Retrieving data
46
var value2 = tree.get('key1');
@@ -51,15 +51,11 @@ if (tree.has('key2')) {
51
}
52
53
// Removing data from binary search tree
54
-var removedData = tree.remove('key1');
+var wasDeleted = tree.delete('key1');
55
56
-try {
57
- tree.remove('absent key');
58
-}
59
-catch (error) {
60
- // You cannot remove data with absent key
61
- console.log(error);
62
+tree.forEach(function(value, key) {
+ // do something with tree values
+});
63
```
64
65
#API#
0 commit comments