2023 SPRING CS 445 PROJECT #3: LINKED LIST OPERATIONS 2

You will build on your Lab#3 implementation by adding several more methods to your LinkedList class.

You are given the following files which comprise a partial implementation of a Linked List + a Tester

• the Node class YOU MUST MODIFY & COPY INTO BOTTOM OF LinkedList FILE
• 
  
• the LinkedList class FILL IN METHODS AT BOTTOM
• 
  
• the LinkedListTester DO NOT MODIFY

You are given the following input files used by Tester

• set1.txt
• set2.txt



In lecture we illustrated and explained the LinkedList ADT and some of the typical operations it would have defined in it. You must fill in the incomplete methods in the LinkedList class such that it executes correctly with the Tester. As usual your output must match the expected output indicated by the screen shots

Implement the following methods in your LinkedList.java file


Write them as conscisely and simply as you can

1. public int size() Write simplest loop you can to count the Nodes
2. public boolean empty() Must call size() NOT examine head and be written as 1 line return statement
3. public boolean contains( T key ) Must call search and be written as 1 line return statement
4. public Node<T> search( T key ) 1 simple loop return ref to 1st Node that contains key value
5. public void insertAtTail(T data) Walk list to caboose (last Node). new Node become the new caboose
6. public void insertInOrder(T data) Insert Node into proper alphabetic/lexical position in list
   *** insertInOrder DO NOT cast to Comparable becuase we do .
7. public boolean remove(T key) Walk list until you find 1st Node with this key. Remove Node w/out breaking list
8. public boolean removeAtTail() Remove the caboose Node
9. public boolean removeAtFront() Remove the first Node of list w/out breaking list
   # THESE NEXT 4 METHODS PRODUCE THE SAME RESULT AS ARRBAG. NO DUPES ALLOWED. MUST TEST BEFORE ADDING TO RESULT
10. public LinkedList<T> union( LinkedList<T> other )
11. public LinkedList<T> inter( LinkedList<T> other )
12. public LinkedList<T> diff( LinkedList<T> other )
13. public LinkedList<T> xor( LinkedList<T> other )