Get Node Value

                            Solution in C :

In C++ :
   

/*
  Get Nth element from the end in a linked list of integers
  Number of elements in the list will always be greater than N.
  Node is defined as 
  struct Node
  {
     int data;
     struct Node *next;
  }
*/
int GetNode(Node *head,int positionFromTail)
{
  // This is a "method-only" submission. 
  // You only need to complete this method. 
    
    int count = 0;
    
    Node *ptr = head;
    
    while(ptr!=NULL)
    {
        ++count;
        ptr=ptr->next;
    }
    
    count = count-positionFromTail;
    
    ptr=head;
    --count;
    
    while(count!=0)
    {
        --count;
        ptr=ptr->next;
    }
    
    return ptr->data;
}



In python3 : 

def GetNode(head, position):
    nums = []
    current = head
    
    # First find tail of list as length is unknown
    while current != None:
        nums.append(current.data)
        current = current.next
    
    # Return value of item at given position
    return nums[ len( nums ) - position - 1 ]
    



In java :


/*
  Insert Node at the end of a linked list 
  head pointer input could be NULL as well for empty list
  Node is defined as 
  class Node {
     int data;
     Node next;
  }
*/
    
int GetNode(Node head,int n) {
     // This is a "method-only" submission. 
     // You only need to complete this method. 
    
   
    
     if(head.next==null)
         return head.data;
     Node temp=head;
     int count=0;
     while(temp!=null)
         {
         count++;
         temp=temp.next;
     }
    
    int k=count-n-1;
    temp=head;
    while(k>0)
        {
        
         k--;
         temp=temp.next;
    }
    return temp.data;
    
    

}



In C :


// Complete the getNode function below.

/*
 * For your reference:
 *
 * SinglyLinkedListNode {
 *     int data;
 *     SinglyLinkedListNode* next;
 * };
 *
 */
int getNode(SinglyLinkedListNode* head, int positionFromTail) {
    int c = 1, i = 1;
        SinglyLinkedListNode *ptr = head;
        while(ptr->next != NULL){
            c += 1;
            ptr = ptr->next;
        }
        if(positionFromTail == 0)
            return ptr->data;
        ptr = head;
        c = c - positionFromTail;
        while(i != c){
            ptr = ptr->next;
            i += 1;
        }
        return ptr->data;
}