find min in binary tree.cpp

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

int FindMin(BstNode *root)
{
    if (root == NULL)
    {
        cout << "Error: Tree is empty\n";
        return -1;
    }
    BstNode *current = root;
    while (current->left != NULL)
    {
        current = current->left;
    }
    return root->data;
}