X409: Linked Chain Find Last Node By Value

0 / 10

Consider the following class definitions:

public static final class LinkedChain<T> { private Node<T> topNode; private int...

X409: Linked Chain Find Last Node By Value

Consider the following class definitions:

public static final class LinkedChain<T> {
    private Node<T> topNode;
    private int numberOfEntries;

    public LinkedChain() {
        this.topNode = null;
        numberOfEntries = 0;
    }// end default constructor


    public Node<T> getTopNode() {
        return topNode;
    }

    public int getNumberOfEntries() {
        return numberOfEntries;
    }

    public boolean compareNodes(Node<T> n1, Node<T> n2) {
        return n1.equals(n2);
    }

    public void push(T newEntry) {
        // TODO Auto-generated method stub
        topNode = new Node<T>(newEntry, topNode);
        numberOfEntries++;
    }
}

Where node looks like this:

public class Node<T> {
     private T data; // Entry in bag
     private Node<T> next; // Link to next node

     public Node(T dataPortion) {
         this(dataPortion, null);
     } // end constructor


     public Node(T dataPortion, Node<T> nextNode) {
         data = dataPortion;
         next = nextNode;
     } // end constructor


     public T getData() {
         if (data != null) {
             return data;
         }
         return null;
     }


     public Node getNext() {
         return next;
     }


     public void setNext(Node<T> newNext) {
         next = newNext;
     }
}

Below, write a Linked Chain method that will return a reference to the last node in the chain containing data that equals to a passed parameter (otherwise return null).


Initial Setup	Final Configuration

Your Answer:

Feedback

Your feedback will appear here when you check your answer.