Javai have to make a method that takes a linked list and then retu.pdf
- 1. Java i have to make a method that takes a linked list and then returns a new linked list that is the reverse of the original this is the starting code /** * LinkedList lab. * @author Emma Cheney * @version 10/2/23 */ public class LinkedList { /** * Internal Node class used for the linked list. */ public class Node { String key; int value; Node next; /** * Node Constructor. * @param key The Key * @param value The Value */ public Node(String key, int value) { this.key = key; this.value = value; } }
- 2. private Node head; private Node tail; /** * The default constructor. */ public LinkedList() { head = null; tail = null; } /** * Add the key, value pair to the head of the linkedlist. * @param key The Key * @param val The Value * */ public void addHead(String key, int val) { Node n = new Node(key, val); if (head == null) { head = n; tail = n; } else { n.next = head; head = n; } } /** * Add the key, val pair to the tail of the linkedlist. * @param key The Key
- 3. * @param val The Value */ public void addTail(String key, int val) { Node n = new Node(key, val); if (tail == null) { head = n; tail = n; } else { tail.next = n; tail = n; } } /** * Returns the String format of the linkedlist. * @return String The String format. */ public String toString() { String ret = ""; Node curr = head; while (curr != null) { if (curr.next != null) { ret += curr.key + ":" + curr.value + ", "; } else { ret += curr.key + ":" + curr.value; } curr = curr.next;
- 4. } return ret; } /** * Locate the Node in the linkedlist with the given key. * @param key The key to find in the LinkedList * @return Node Returns the Node with the given key or null if non-existent. */ private Node find(String key) { Node curr = head; while (curr != null) { if (curr.key.equals(key)) { return curr; } curr = curr.next; } return null; } A static method called reversed that takes a LinkedList as a parameter and returns a new LinkedList that is reversed. f; traverse through the input list (starting at the head). In order to reverse the ordering, you need to add the current node's key and value onto the head of the new list (addHead method). Do not change the input list or any values in it. Example (result in red) //assumelistcontainsthesekeysandvalues://ie:6,bi:48,bi:73,bi:63LinkedList.reversed(list);bi:63,bi: 73,bi:48,ie:6