MCPcopy Create free account
hub / github.com/BeeBombshell/Python-DSA / traverse

Method traverse

DSA/circularLinkedList.py:126–136  ·  view source on GitHub ↗
(self)

Source from the content-addressed store, hash-verified

124 return last
125
126 def traverse(self):
127 if self.last == None:
128 print("The list is empty")
129 return
130
131 newNode = self.last.next
132 while newNode:
133 print(newNode.data, end=" ")
134 newNode = newNode.next
135 if newNode == self.last.next:
136 break
137
138if __name__ == "__main__":
139

Callers 1

Calls

no outgoing calls

Tested by

no test coverage detected