Attached is theLinkedListclass from this chapter and theListIteratorclass. It has the reverse...

Question

Attached is theLinkedListclass from this chapter and theListIteratorclass. It has the reverse method, which I demonstrated on the Example video. Your assignment is to do the following:

- in addition to thefirstdata member, add alastdata member, which will always point to the last node in the list (or null if the list is empty).

- add a "size" method to the LinkedList class that returns the number of nodes in the list

- add an "addLast" method to the LinkedList class

- add a "removeLast" method to the LinkedList class

- add a "getLast" method to the LinkedList class

- add a "contains" method to the LinkedList class that returns true or false whether its parameter value is on the list

NOTE: NoSuchElementException should be thrown where appropriate

import java.util.NoSuchElementException; /** A program that demonstrates the LinkedList class */ public class ListDemo { public static void printList(LinkedList ll) { ListIterator iterator = ll.listIterator(); System.out.print("Size of list: " + ll.size() + "; list is "); while (iterator.hasNext()) { System.out.print(iterator.next() + " "); } if (ll.size() > 0) System.out.print("FIRST is " + ll.getFirst() + " "); if (ll.size() > 0) System.out.print("LAST is " + ll.getLast()); System.out.println(); } public static void main(String[] args) { LinkedList staff = new LinkedList(); printList(staff); staff.addFirst("Tom"); staff.addFirst("Romeo"); staff.addFirst("Harry"); printList(staff); try { staff.removeFirst(); printList(staff); } catch (NoSuchElementException ex) { System.out.println ("No such element"); } try { staff.removeFirst(); printList(staff); } catch (NoSuchElementException ex) { System.out.println ("No such element"); } try { staff.removeFirst(); printList(staff); } catch (NoSuchElementException ex) { System.out.println ("No such element"); } try { staff.removeFirst(); printList(staff); } catch (NoSuchElementException ex) { System.out.println ("No such element"); } try { staff.addLast("Roger"); printList(staff); } catch (NoSuchElementException ex) { System.out.println ("No such element"); } try { staff.removeFirst(); printList(staff); } catch (NoSuchElementException ex) { System.out.println ("No such element"); } try { System.out.println(staff.getLast()); printList(staff); } catch (NoSuchElementException ex) { System.out.println ("No such element"); } try { staff.addLast("Jane"); printList(staff); } catch (NoSuchElementException ex) { System.out.println ("No such element"); } try { staff.addLast("Judy"); printList(staff); } catch (NoSuchElementException ex) { System.out.println ("No such element"); } try { staff.removeLast(); printList(staff); } catch (NoSuchElementException ex) { System.out.println ("No such element"); } try { staff.removeLast(); printList(staff); } catch (NoSuchElementException ex) { System.out.println ("No such element"); } try { staff.addLast("Ken"); staff.addFirst("Debbie"); staff.addLast("Barbie"); staff.addFirst("Jack"); printList(staff); } catch (NoSuchElementException ex) { System.out.println ("No such element"); } try { System.out.println(staff.contains("Mark")); System.out.println(staff.contains("Jack")); } catch (NoSuchElementException ex) { System.out.println ("No such element"); } try { staff.removeLast(); printList(staff); } catch (NoSuchElementException ex) { System.out.println ("No such element"); } try { staff.removeLast(); printList(staff); } catch (NoSuchElementException ex) { System.out.println ("No such element"); } try { staff.removeLast(); printList(staff); } catch (NoSuchElementException ex) { System.out.println ("No such element"); } try { staff.removeLast(); printList(staff); } catch (NoSuchElementException ex) { System.out.println ("No such element"); } try { staff.removeLast(); printList(staff); } catch (NoSuchElementException ex) { System.out.println ("No such element"); } try { System.out.println(staff.contains("Mark")); System.out.println(staff.contains("Jack")); } catch (NoSuchElementException ex) { System.out.println ("No such element"); } } } /** A list iterator allows access of a position in a linked list. This interface contains a subset of the methods of the standard java.util.ListIterator interface. The methods for backward traversal are not included. */ public interface ListIterator { /** Moves the iterator past the next element. @return the traversed element */ Object next(); /** Tests if there is an element after the iterator position. @return true if there is an element after the iterator position */ boolean hasNext(); /** Adds an element before the iterator position and moves the iterator past the inserted element. @param element the element to add */ void add(Object element); /** Removes the last traversed element. This method may only be called after a call to the next() method. */ void remove(); /** Sets the last traversed element to a different value. @param element the element to set */ void set(Object element); }

linkedlist-zie2104a.java listdemo-52u5t2we.java listiterator-ofidbd2b.java

Kshitij · Accepted Answer

LinkedList iterator/LinkedListDemo.java
LinkedList iterator/LinkedListDemo.java
/*   Created by IntelliJ IDEA.
 *   Author: Kshitij Varshney (kshitijvarshne1)
 *   Date: 08-Apr-21
 *   Time: 5:25 PM
 *   File: LinkedListDemo.java
 */
package April.api09_21.two;
import java.util.NoSuchElementException;
public class LinkedListDemo {
    private Node first;
    /**
     * Constructs an empty linked list.
     */
    public LinkedListDemo() {
        first = null;
    }
    /**
     * Returns the first element in the linked list.
     *
     * @return the first element in the linked list
     */
    public Object getFirst() {
        if (first == null) {
            throw new NoSuchElementException();
        }
        return first.data;
    }
    /**
     * Removes the first element in the linked list.
     *
     * @return the removed element
     */
    public Object removeFirst() {
        if (first == null) {
            throw new NoSuchElementException();
        }
        Object element = first.data;
        first = first.next;
        return element;
    }
    public Object getLast() {
        if (first == null) {
            throw new NoSuchElementException();
        } else {
            Node temp = first;
            while (temp.next != null) {
                temp = temp.next;
            }
            return temp.data;
        }
    }
    public void addLast(Object element) {
        Node newNode = new Node();
        newNode.data = element;
        if (first == null) {
            first = newNode;
        } else {
            Node temp = first;
            while (temp.next != null) {
                temp = temp.next;
            }
            temp.next = newNode;
        }
    }
    public int size() {
        if (first == null) {
            return 0;
        } else {
            Node temp = first;
            int c = 0;
            while (temp != null) {
                c += 1;
                temp = temp.next;
            }
            return c;
        }
    }
    public void removeLast(){
        if(first==null){
            throw new NoSuchElementException();
        }
        else if(first.next==null){
            first= null;
        }
        else{
            Node temp= first;
            while(temp.next.next!=null){
                temp=temp.next;
            }
            temp.next=null;
        }
    }
    public boolean contains(String s){
        if(first==null){
            return false;
        }
        else{
            Node temp = first;
            while(temp !=null){
                if(s.equalsIgnoreCase((String) temp.data)){
                    return true;
                }
                temp=temp.next;
            }
            return false;
        }
    }
    /**
     * Adds an element to the front of the linked list.
     *
     * @param element the element to add
     */
    public void addFirst(Object element) {
        Node newNode = new Node();
        newNode.data = element;
        newNode.next = first;
        first = newNode;
    }
    /**
     * Returns an iterator for iterating through this list.
     *
     * @return an iterator for iterating through this list
     */
    public ListIterator listIterator() {
        return new LinkedListIterator();
    }
    /**
     * Reverses the list by directly re-routing the links, NOT
     * by using an iterator
     */
    public void reverse() {
        // no need to reverse an empty list
        if (first == null) return;
        // no need to reverse a list with one element
        if (first.next == null) return;
        Node thisOne = first;
        Node nextOne = first.next;
        while (nextOne != null) {
            Node temp = nextOne.next;
            nextOne.next = thisOne;
            thisOne = nextOne;
            nextOne = temp;
        }
        first.next = null;

Attached is the LinkedList class from this chapter and the ListIterator class. It has the reverse method, which I demonstrated on the Example video. Your assignment is to do the following: - in...

Answer To: Attached is the LinkedList class from this chapter and the ListIterator class. It has the reverse...

Answer To This Question Is Available To Download

Related Questions & Answers

Submit New Assignment