1: // Recursively searches a chain of nodes for desiredItem, 2: // beginning with the node that currentNode references. 3: private boolean search(Node currentNode, T desiredItem) 4: { 5: boolean found; 6: 7: if (currentNode == null) 8: found = false; 9: else if (desiredItem.equals(currentNode.getData())) 10: found = true; 11: else 12: found = search(currentNode.getNextNode(), desiredItem); 13: 14: return found; 15: } // end search 16: 17: public boolean contains(T anEntry) 18: { 19: return search(firstNode, anEntry); 20: } // end contains 21: // Version 4.0