class OrderedList: def __init__(self) : self. head = None def add(self, item) : current = self. head def search(self, item) : previous = None current = self.head stop = False found = False while current != None and not stop: stop = False if current . getData() > item: while current != None and not found stop = True if current. getData() == item: else: found = True previous = current else: current = current. getNext() if current . getData() > item temp = Node(item) stop = True if previous = None: else: temp . setNext(self . head) current = current.getNe self. head = temp else: return found temp. setNext(current)