double FindMin(Tree *t)
{
	queue<Tree*> q;
	q.push(t);
	double ans = 100000000;
	while (!q.empty())
	{
		Tree* t = q.front();
		q.pop();
		ans = min(t->val,ans);
		if (t->left != 0)
			q.push(t->left);
		if (t->right != 0)
			q.push(t->right);
	}
	return ans;
}