декартовое дерево 2

bool search(node* A, int need_found) // поиск элементов.
{
    if (!A)
        return false;

    if (A->value_node == need_found)
        return true;

    if (A->value_node < need_found)
    {
        return search(A->right, need_found);
    }
    else
    {
        return search(A->left, need_found);
    }
}