int MinBST(node *pTr)
{
	if(root == NULL)
	{
		print “There is nothing in the tree”;
		return maximum integer;
}
else
{
	If(pTr.left != NULL)
	{
		return MinBst(pTr.left);
	}
	else
{
	return pTr.key;
}
}
}