Binary Search Trees in JS

A JavaScript implementation of two Binary Search Tree data structures.

Usage

Click on the Live link above and use the graphical interface to see the trees in action.

The following commands are available to construct BST's. The Red-Black Tree extends the BST so all of the above functions are also available.

add - Add a value or TreeNode object to the BST

clear - Resets root to null

print - Depth-first prints the tree

find - Locate a value (if the value is not found, locates the closest node)

deleteVal - Locate a node with given value and deletes it if found

min - Traverses tree for node with minimum value

Name		Name	Last commit message	Last commit date
Latest commit History 6 Commits
css		css
dist		dist
lib		lib
spec		spec
.gitignore		.gitignore
README.md		README.md
SpecRunner.html		SpecRunner.html
index.html		index.html
package.json		package.json
webpack.config.js		webpack.config.js