Challenge 1: Finding Minimum Value in a Binary Search Tree

Problem statement

Implement the int findMin(Node* rootNode) function, which will find the minimum value in a given binary search tree. Remember that a binary search tree is a binary tree that satisfies the following property:

$NodeValues\left(LeftSubtree\right)<=CurrentNodeValue<NodeValues(RightSubTree$ ...