C++ Linked List Exercises: Get N^th node in a Singly Linked List

C++ Linked List: Exercise-8 with Solution

Write a C++ program to get N^th node in a given Singly Linked List.

Test Data:
Original list:
7 5 3 1
Position: 1
Value: 7
Position: 2
Value: 5
Position: 3
Value: 3
Position: 4
Value: 1

Sample Solution:

C++ Code:

#include <iostream>

using namespace std;

struct  Node
{   
    int num;
    Node *next;
 }; //node constructed

  int size = 0;
  void insert(Node** head, int num){
    Node* new_Node = new Node();
    new_Node->num = num;
    new_Node->next = *head;
    *head = new_Node;    
     size++;
}

int get_Nth_Node(Node *head, int value)
{
Node *current_Pointer = head;
int length = 0;
while (current_Pointer != NULL) {
        if (length == value)
            return (current_Pointer->num);
        length++;
        current_Pointer = current_Pointer->next;
}
    return -1;
}
 
  //Display all nodes
  void display_all_nodes(Node* node)
    { 
      while(node!=NULL){
        cout << node->num << " "; 
        node = node->next; 
    } 
}

int main()
{
    Node* head = NULL;
    insert(&head,1);
    insert(&head,3);
    insert(&head,5);
    insert(&head,7);
    cout << "Original list:\n";
    display_all_nodes(head); 
    int pos = 1;
    cout << "\n\nPosition: " << pos;
    int result = get_Nth_Node(head, pos-1);
    cout << "\nValue: " << result;
    pos = 2;
    cout << "\n\nPosition: " << pos;
    result = get_Nth_Node(head, pos-1);
    cout << "\nValue: " << result;
    pos = 3;
    cout << "\n\nPosition: " << pos;
    result = get_Nth_Node(head, pos-1);
    cout << "\nValue: " << result;
    pos = 4;
    cout << "\n\nPosition: " << pos;
    result = get_Nth_Node(head, pos-1);
    cout << "\nValue: " << result;
    cout<<endl;
    return 0;
}

Sample Output:

Original list:
7 5 3 1

Position: 1
Value: 7

Position: 2
Value: 5

Position: 3
Value: 3

Position: 4
Value: 1

Flowchart:

CPP Code Editor:

Contribute your code and comments through Disqus.

Previous C++ Exercise: Insert new node at the middle of a Singly Linked List.
Next C++ Exercise: Insert a node at any position of a Singly Linked List.