BST/bst_codeschool.cpp
// finds minimum element present in the bst
finds minimum element present in the bst
finds minimum element present in the bst
BstNode *min_node_bst(BstNode *p)
{
	if (p == NULL)
	{
		return NULL;
	}
	while (p->left)
	{
		p = p->left;
	}
	return p;
}
BstNode * min_node_bst ( BstNode * p ) { if ( p == NULL ) { return NULL ; } while ( p -> left ) { p = p -> left ; } return p ; }
finds minimum element present in the bst
finds minimum element present in the bst
// check if root node is null or not // while(p's left child is not null) // shift p to p's left // return the node