sixth.cpp

#include <iostream>
using namespace std;
struct node {
    int data;
    node* next;
};
node* head;
node* getNewNode(int x)
{
    node* temp = new node();
    temp->data = x;
    temp->next = NULL;
    return temp;
}
void insert(int x,int n) {
    node* temp = getNewNode(x);
    node* temp1 = head;
    if (n==1) {
        temp->next = head;
        head = temp;
    }
    else
    {
        for (int i = 0; i < n - 2; i++) {
            temp1 = temp1->next;
        }
        temp->next = temp1->next;
        temp1->next = temp;
    }
}
node* problem(int n) {
    node* temp = head;
    node* tempen = head;
    while (--n) {
        temp=temp->next;
    }
    while (temp->next != NULL) {
        tempen = tempen->next;
        temp = temp -> next;
    }
    return tempen;
}
void display() {
    node* temp = head;
    while (temp != NULL) {
        std::cout << temp->data << '\n';
        temp = temp -> next;
    }
}
int main(int argc, char const *argv[]) {
    head = NULL;
    int n;
    insert(2,1);
    insert(4,2);
    insert(6,3);
    insert(8,4);
    insert(10,5);
    insert(12,6);
    insert(14,7);
    insert(16,8);
    display();
    std::cout <<"Enter the value of n"<< '\n';
    std::cin >> n;
    std::cout << "The nth number is "<< problem(n)->data << '\n';
    return 0;
}