Homework 8 - else {...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
//Page 177 #9 //a. First in the chain public void addToFront(T newEntry){ DNode newNode = new DNode( null , newEntry, firstNode); if (isEmpty()) lastNode = newNode; else firstNode.setPreviousNode(newNode); firstNode = newNode; } // end addToFront //b. Last in the chain public void addToBack(T newEntry) { DNode newNode = new DNode(lastNode, newEntry, null ); if (isEmpty()) firstNode = newNode; else lastNode.setNextNode(newNode); lastNode = newNode; } //c. Between existing nodes in the chain. public void addToBetween(T newEntry, int position) { DNode newNode = new DNode(getNodeAt(position-1), newEntry, getNodeAt(position)); if (isEmpty()) firstNode = newNode;
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: else { getNodeAt(position-1).setNextNode(newNode); getNodeAt(position).setPreviousNode(newNode); } } //Page 198 #7 // a) Remove First public T removeFirst (){ T first = null ; if (!isEmpty ()) { first = firstNode.getData (); firstNode = firstNode.next; if (firstNode == null ) lastNode = null ; else firstNode.setPreviousNode ( null ); } return first; } // b) Remove Last public T removeLast() { T last = null ; if (!isEmpty ()) { last = lastNode.getData (); lastNode = lastNode.getPreviousNode (); if (lastNode == null ) firstNode = null ; else lastNode.setNextNode ( null ); } return last; }...
View Full Document

This note was uploaded on 01/23/2012 for the course CS 111C taught by Professor Metzler during the Spring '11 term at City College of San Francisco.

Page1 / 2

Homework 8 - else {...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online