Understanding iterative minimum search

Step 1.1: If the root node does not have a left child, return it.
Step 1.2: Else, if the root node has a left child, update the root node to hold the reference of its left child.

The iterative algorithm for finding the minimum value is very similar to the recursive algorithm. We replace recursive calls with a loop and keep going left until we reach the leftmost node (the node with no left child), which is where the minimum is.

1 of 5

Searching for the minimum value in a binary search tree

Algorithm

Step 1: While root is not null, do the following:

Step 1.1: If the root node does not have a left child, return it.

Step 1.2: Else, if the root node has a left child, update the root node to hold the reference of its left child.