def test(): lst = LinkedList() lst.push(10) lst.push(4) lst.push(15) lst.push(20) lst.push(50) #create a loop lst.head.next.next.next.next.next = lst.head.next.next detectAndRemove(lst.head) printNode(lst.head)
def test(): lst = LinkedList() lst.push(10) lst.push(4) lst.push(15) lst.push(20) lst.push(50) #create a loop lst.head.next.next.next.next.next = lst.head.next.next print('create loop at ', lst.head.next.next.next.next.next.data) detectAndRemove(lst.head) printNode(lst.head)
from LinkedListDS.LinkedList import LinkedList linkedlist = LinkedList() linkedlist.insertEnd(12) linkedlist.insertEnd(222) linkedlist.insertEnd(3) linkedlist.insertStart(31) linkedlist.traverseList() linkedlist.remove(12) linkedlist.traverseList()
from LinkedListDS.LinkedList import LinkedList linkedlist = LinkedList() linkedlist.insertStart(12) linkedlist.insertStart(122) linkedlist.insertStart(4) linkedlist.insertStart(97) linkedlist.traverseList() linkedlist.remove(12) linkedlist.traverseList()
from LinkedListDS.LinkedList import LinkedList linkedList = LinkedList() linkedList.insertAtEnd(12) linkedList.insertAtEnd(122) linkedList.insertAtEnd(21) linkedList.insertAtEnd(23) linkedList.insertStart(4) linkedList.insertStart(3123) linkedList.traverseList() linkedList.remove(12) linkedList.traverseList()
from LinkedListDS.LinkedList import LinkedList; linkedList = LinkedList(); # inserting linkedList.insertEnd(12); linkedList.insertEnd(122); linkedList.insertEnd(3); linkedList.insertStart(31); # traversing I linkedList.traverseList(); print("============ going to remove ============") # removing linkedList.remove(12); # traversing II linkedList.traverseList();
from LinkedListDS.LinkedList import LinkedList l1 = LinkedList() l1.insertStart(12) l1.insertEnd(156) l1.insertEnd(213) l1.insertEnd(212) l1.traverseList() l1.remove(12) l1.insertStart(100) l1.traverseList()
''' Created on 18-Oct-2019 @author: anuragsengupta ''' from LinkedListDS.LinkedList import LinkedList linkedList = LinkedList() linkedList.insertEnd(12) linkedList.insertEnd(122) linkedList.insertEnd(31) linkedList.insertEnd(321) linkedList.insertStart(43) linkedList.traverseList() print(linkedList.size()) linkedList.remove(31) linkedList.traverseList() print(linkedList.size())
from LinkedListDS.LinkedList import LinkedList linkedList = LinkedList() linkedList.insert(12) linkedList.insert(121) linkedList.insert(13) linkedList.insert(1) linkedList.insert(31) linkedList.traverseList() linkedList.remove(12) linkedList.traverseList()
def test(): lst = LinkedList() lst.push(9) lst.push(8) lst.push(7) lst.push(6) lst.push(5) lst.push(4) lst.push(3) lst.push(2) lst.push(1) lst.print_list() head = reverse(lst.head, 3) printNode(head)
from LinkedListDS.LinkedList import LinkedList linkedList = LinkedList(); linkedList.insertStart(15) linkedList.insertEnd(122) linkedList.insertEnd(135) linkedList.insertStart(3) linkedList.traverseList() linkedList.remove(122) linkedList.traverseList()