判断一棵树是否二叉搜索树BST

// 判断二叉搜索树
typedef struct binary_tree_node
{
    int value;
    BINARY_TREE_NODE* left;
    BINARY_TREE_NODE* right;
}BINARY_TREE_NODE;

bool is_valid_bst(BINARY_TREE_NODE* root)
{
    if (root == nullptr)
    {
        return true;
    }

    return is_valid_bst_part(root->left, nullptr, &root->value) && is_valid_bst_part(root->right, &root->value, nullptr);
}

bool is_valid_bst_part(BINARY_TREE_NODE* root, int* min, int* max)
{
    if (root == nullptr)
    {
        return true;
    }

    if ((root->left && root->value <= root->left->value) || (root->right && root->value >= root->right->value))
    {
        return false;
    }

    if ((min && root->value <= *min) || (max && root->value >= *max))
    {
        return false;
    }

    return is_valid_bst_part(root->left, min, &root->value) && is_valid_bst_part(root->right, &root->value, max);
}