@@ -0,0 +1,1451 @@
+/*%0A * Copyright (C) 2014 Pedro Vicente G%C3%B3mez S%C3%A1nchez.%0A *%0A * Licensed under the Apache License, Version 2.0 (the %22License%22);%0A * you may not use this file except in compliance with the License.%0A * You may obtain a copy of the License at%0A *%0A * http://www.apache.org/licenses/LICENSE-2.0%0A *%0A * Unless required by applicable law or agreed to in writing, software%0A * distributed under the License is distributed on an %22AS IS%22 BASIS,%0A * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.%0A * See the License for the specific language governing permissions and%0A * limitations under the License.%0A */%0Apackage com.github.pedrovgs.linkedlist;%0A%0A/**%0A * Main class for linked list data structure. A linked list is a data structure consisting of a%0A * group of nodes which together represent a sequence. Under the simplest form, each node is%0A * composed of a data and a reference (in other words, a link) to the next node in the sequence;%0A * more complex variants add additional links. This structure allows for efficient insertion or%0A * removal of elements from any position in the sequence.%0A *%0A * @author Pedro Vicente G%C3%B3mez S%C3%A1nchez.%0A */%0Apublic class ListNode%3CT%3E %7B%0A%0A  private final T data;%0A  private ListNode%3CT%3E next;%0A%0A  public ListNode(T data) %7B%0A    this.data = data;%0A  %7D%0A%0A  public T getData() %7B%0A    return data;%0A  %7D%0A%0A  public ListNode%3CT%3E getNext() %7B%0A    return next;%0A  %7D%0A%0A  public void setNext(ListNode%3CT%3E next) %7B%0A    this.next = next;%0A  %7D%0A%0A%7D%0A

Create base data structure to problem 22