search

henrylin03 / odin-binary-search-tree

Implementing balanced binary search tree (BST) from a sorted array in JavaScript, as part of The Odin Project's "Full Stack JavaScript" course
MIT License
0 stars 0 forks source link

write `find(value)` function #7

Closed henrylin03 closed 1 month ago

henrylin03 commented 1 month ago

Write a find(value) function that returns the node with the given value.

henrylin03 commented 1 month ago

once we write this, we need to leverage this potentially to ensure that when we try to .insert() a value, that value doesn't already exist - #6