Lab4soln - Node<E> current = head for(int i = 0 i< index numElements i current = current.next print until get back to the startingNode

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
1. public void add(E element) { if (numElements == 0) { head = new Node<E>(element); head.next = head; } else { head.next = new Node<E>(element, head.next); } numElements++; } 2. public void display(int index) { if (index < 0) { System.out.println("Invalid index: negative value"); return; } if (numElements == 0) return; // Advance to starting node
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Node<E> current = head; for (int i = 0; i < index % numElements; i++) { current = current.next; } // print until get back to the startingNode Node<E> startingNode = current; do { System.out.print(current.data); current = current.next; } while (current != startingNode); System.out.println(); }...
View Full Document

This note was uploaded on 12/19/2009 for the course CS 121 taught by Professor Reid-miller during the Spring '09 term at Carnegie Mellon.

Ask a homework question - tutors are online