int min(BstNode* bst)
{
	if (bst != NULL)
	{
		while (bst->left = NULL) bst->left;
		int min = 0;
		bst-> min;
		return min;
	}
}