Linked Lists - Get Nth

Implement a GetNth() function that takes a linked list and an integer index and returns the node stored at the Nth index position. GetNth() uses the C numbering convention that the first node is index 0, the second is index 1, ... and so on.

So for the list 42 -> 13 -> 666, GetNth(1) should return Node(13);

getNth(1 -> 2 -> 3 -> null, 0).data === 1
getNth(1 -> 2 -> 3 -> null, 1).data === 2

Node.GetNth(1 -> 2 -> 3 -> null, 0).Data == 1
Node.GetNth(1 -> 2 -> 3 -> null, 1).Data == 2

The index should be in the range [0..length-1]. If it is not, or if the list is empty, GetNth() should throw/raise an exception (ArgumentException in C#, InvalidArgumentException in PHP, Exception in Java).

Related Kata in order of expected completion (increasing difficulty):

• Linked Lists - Push & BuildOneTwoThree
• Linked Lists - Length & Count
• Linked Lists - Get Nth Node
• Linked Lists - Insert Nth Node
• Linked Lists - Sorted Insert
• Linked Lists - Insert Sort
• Linked Lists - Append
• Linked Lists - Remove Duplicates
• Linked Lists - Move Node
• Linked Lists - Move Node In-place
• Linked Lists - Alternating Split
• Linked Lists - Front Back Split
• Linked Lists - Shuffle Merge
• Linked Lists - Sorted Merge
• Linked Lists - Merge Sort
• Linked Lists - Sorted Intersect
• Linked Lists - Iterative Reverse
• Linked Lists - Recursive Reverse

Inspired by Stanford Professor Nick Parlante's excellent Linked List teachings.

http://cslibrary.stanford.edu/103/LinkedListBasics.pdf

http://cslibrary.stanford.edu/105/LinkedListProblems.pdf