**Get Node Value**

### Problem Statement :

This challenge is part of a tutorial track by MyCodeSchool Given a pointer to the head of a linked list and a specific position, determine the data value at that position. Count backwards from the tail node. The tail is at postion 0, its parent is at 1 and so on. Example head refers to 3 -> 2 -> 1 -> 0 -> NULL positionFromTail = 2 Each of the data values matches its distance from the tail. The value 2 is at the desired position. Complete the getNode function in the editor below. getNode has the following parameters: SinglyLinkedListNode pointer head: refers to the head of the list int positionFromTail: the item to retrieve Returns int: the value at the desired position Input Format The first line contains an integer t, the number of test cases. Each test case has the following format: The first line contains an integer n, the number of elements in the linked list. The next n lines contains an integer, the data value for an element of the linked list. The last line contains an integer positionFromTail, the position from the tail to retrieve the value of. Function Description

### Solution :

` ````
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;
}
```

## View More Similar Problems

## Square-Ten Tree

The square-ten tree decomposition of an array is defined as follows: The lowest () level of the square-ten tree consists of single array elements in their natural order. The level (starting from ) of the square-ten tree consists of subsequent array subsegments of length in their natural order. Thus, the level contains subsegments of length , the level contains subsegments of length , the

View Solution →## Balanced Forest

Greg has a tree of nodes containing integer data. He wants to insert a node with some non-zero integer value somewhere into the tree. His goal is to be able to cut two edges and have the values of each of the three new trees sum to the same amount. This is called a balanced forest. Being frugal, the data value he inserts should be minimal. Determine the minimal amount that a new node can have to a

View Solution →## Jenny's Subtrees

Jenny loves experimenting with trees. Her favorite tree has n nodes connected by n - 1 edges, and each edge is ` unit in length. She wants to cut a subtree (i.e., a connected part of the original tree) of radius r from this tree by performing the following two steps: 1. Choose a node, x , from the tree. 2. Cut a subtree consisting of all nodes which are not further than r units from node x .

View Solution →## Tree Coordinates

We consider metric space to be a pair, , where is a set and such that the following conditions hold: where is the distance between points and . Let's define the product of two metric spaces, , to be such that: , where , . So, it follows logically that is also a metric space. We then define squared metric space, , to be the product of a metric space multiplied with itself: . For

View Solution →## Array Pairs

Consider an array of n integers, A = [ a1, a2, . . . . an] . Find and print the total number of (i , j) pairs such that ai * aj <= max(ai, ai+1, . . . aj) where i < j. Input Format The first line contains an integer, n , denoting the number of elements in the array. The second line consists of n space-separated integers describing the respective values of a1, a2 , . . . an .

View Solution →## Self Balancing Tree

An AVL tree (Georgy Adelson-Velsky and Landis' tree, named after the inventors) is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this property. We define balance factor for each node as : balanceFactor = height(left subtree) - height(righ

View Solution →