codecatcher
codecatcher

Reputation: 1

Unable to compile C++ code: invalid conversion from 'int' to 'node*'

#include<iostream>

using namespace std;

struct node
{
    int data;
    node* next;
};

void pushList(struct node **head_ref, int element)
{
    struct node *temp = (struct node*)malloc(sizeof(struct node));
    temp->data = element;
    temp->next = *head_ref;
    *head_ref = temp;
}

void printList(struct node* node)
{
    while (node != NULL)
    {
        cout << node->data << endl;
        node = node->next;
    }
}

struct node* thirdLastElement(struct node *head)
{
    struct node *slow = head;
    struct node *fast = head;

    if (head == NULL || head->next == NULL)
    {
        cout << " Required Nodes Are Not Present ";
        return 0;
    }


    fast = fast->next->next->next;

    while (fast != NULL)
    {
        slow = slow->next;
        fast = fast->next;
    }

    return(slow->data);
}

int main()
{
    struct node* head = NULL;
    int n;

    cout << " Enter the number of elements " << endl;
    cin >> n;

    for (int i = 0; i < n; i++)
    {
        pushList(&head, i);
    }

    cout << " the list formed is :" << endl;
    printList(head);

    cout << " the third last element is : " << thirdLastElement(head) << endl;

    return 0;
}

I am not able to identify why this error is coming. Plz help me guyz . I am a newbie to C and c++ programming.

Upvotes: 0

Views: 3919

Answers (1)

Doc Brown
Doc Brown

Reputation: 20044

Note that slow->data is an int, but the return value of thirdLastElement must be a node*. You probably wanted to return slow there, and in the main function of your program:

 cout << " the third last element is : " << thirdLastElement(head)->data << endl;

So as a hint: when interpreting compiler error messages, look at the line number in the message, it tells you where the error is.

A note: avoid things like fast = fast->next->next->next without complete checking if all the pointers are valid. You are checking fast and fast->next, but you forgot to check fast->next->next.

Upvotes: 6

Related Questions