Searching in a Binary Search Tree (Implementation)

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 ...