Understanding recursive minimum search

Finding the minimum value in a binary search tree recursively is quite simple. We must traverse to the first node of the tree's inorder sequence. 

Algorithm

Let us look at the recursive algorithm to quickly find the minimum value in a binary search tree. A simple recursive equation can summarise the search process we followed above.