Skip to content

v1.0.8 #9

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 2 commits into from
Jul 15, 2018
Merged

v1.0.8 #9

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
343e11a
readme
eyas-ranjous Jul 15, 2018
ddad824
v1.0.8
eyas-ranjous Jul 15, 2018
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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.
Expand Down
2 changes: 1 addition & 1 deletion package.json
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -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": {
Expand Down