dev/bst_tries_02.cpp
struct node* minValueNode(struct node* node) 
{ 
	struct node* current = node; 

	/* loop down to find the leftmost leaf */
	while (current && current->left != NULL) 
		current = current->left; 

	return current; 
}
/* Given a non-empty binary search tree, return the node with minimum 
key value found in that tree. Note that the entire tree does not 
need to be searched. */
Given a non-empty binary search tree, return the node with minimum
key value found in that tree. Note that the entire tree does not
need to be searched.
Given a non - empty binary search tree return the node with minimum key value found in that tree . Note that the entire tree does not need to be searched .
struct node* minValueNode(struct node* node) 
{ 
	struct node* current = node; 
	while (current && current->left != NULL) 
		current = current->left; 
	return current; 
}
struct node * minValueNode ( struct node * node ) { struct node * current = node ; while ( current && current -> left != NULL ) current = current -> left ; return current ; }
Given a non-empty binary search tree, return the node with minimum
key value found in that tree.
Given a non - empty binary search tree return the node with minimum key value found in that tree .
/* loop down to find the leftmost leaf */