Solution: Find Minimum Value in Binary Search Tree

Statement

Given the root node of a binary search tree (BST), find and return the minimum value present in the BST.

Constraints:

Let n be the number of nodes in a binary search tree.

• $0 \leq$ n $\leq500$

• $-10^4\leq$ Node.data $\leq10^4$

Solution 1: Iterative approach

The essence of the algorithm lies in the property of a BST, where the left subtree of a node contains values smaller than the node's value. Therefore, by traversing always to the left child, the algorithm guarantees that it reaches the minimum value node in the BST. ...