why segmentation f ault(SIGSEGV) in linked list in c++

Question

    int count()
    {
        node *current;
        int c=0;
        current=top;
        while(current->next != NULL)
        {
            c++;
            cur