struct tree {
	int data;
	tree* left;
	tree* right;
};

int find_min(tree* root, int min_elem) {
	if (root != NULL) {
		if (root->data <= min_elem) {
			min_elem = root->data;
		}
		int min1 = find_min(root->left, min_elem);
		int min2 = find_min(root->right, min_elem);
		if (min1 < min2) {
			return min1;
		}
		else {
			return min2;
		}
	}
}