Searching in a Binary Search Tree (Implementation)

This lesson is about Searching in a Binary Search Tree and how to implement searching functionality in JavaScript.

Introduction #

In this lesson, we’ll implement a search function for binary search trees which will return a node from the tree if the value to be searched matches it. We’ll again implement both an iterative and a recursive solution.

Here is a high-level description of the algorithm:

  1. Set the currentNode equal to root.

  2. If the value to be searched is less than the currentNode's value, then move on to the left subtree, otherwise move on to the right subtree.

  3. Repeat until the value at the currentNode is equal to the value searched or it becomes null.

  4. Return the currentNode.

Iterative Search Implementation #

The implementation of the above algorithm in JavaScript is as follows:

Level up your interview prep. Join Educative to access 80+ hands-on prep courses.