Function main

GeeksForGeeks/Palindrome_Linked_List/Solution.cpp:18–43

bool isPalindrome(Node *head);

int main()
{

    int T,i,n,l,firstdata;
    cin>>T;
    while(T--)
    {
        struct Node *head=NULL, *tail=NULL;
        cin>>n;
        cin>>firstdata;
        head=new Node(firstdata);//Creating a new node
        tail=head;

        //Inserting the new node into the linked list
        for(i=1;i<n;i++)
        {

            cin>>l;
            tail->next=new Node(l);
            tail=tail->next;
        }
        cout<<isPalindrome(head)<<"\n";

    }
    return 0;
}

void reverse(struct Node**);
bool compareLists(struct Node*, struct Node*);