Add more linkedlist

Author: Dwipam Katariya

practice/find_loop_ll.py

@@ -0,0 +1,42 @@
+class Node:
+	def __init__(self, key):
+		self.key = key
+		self.next = None
+
+class LinkedList:
+	def __init__(self):
+		self.head = None
+
+	def push(self, key):
+		node = Node(key)
+		node.next = self.head
+		self.head = node
+
+	def find_loop(self):
+		temp1 = self.head
+		temp2 = self.head
+		while temp2:
+			print temp2.key
+			temp1 = temp1.next
+			temp2 = temp2.next.next
+			if temp1 == temp2:
+				print "Loop found at: ",temp1.key
+				return
+	def traverse(self):
+		print "Traversing"
+		temp = self.head
+		while temp:
+			print temp.key
+			temp = temp.next
+
+list_ = LinkedList()
+list_.push(1)
+list_.push(2)
+list_.push(3)
+list_.push(4)
+list_.push(5)
+list_.traverse()
+list_.head.next.next.next = list_.head
+
+list_.find_loop()
+

practice/linked_list.py

@@ -46,13 +46,44 @@ def pop_key(self, key):
 			prev = temp
 			temp = temp.next
 
+	def delete_linked_list(self):
+		print "\n Deleting Linked List"
+		while self.head:
+			temp = self.head
+			self.head = self.head.next
+			temp = None
+
+	def len(self):
+		cnt = 0
+		temp = self.head
+		while temp:
+			cnt+=1
+			temp = temp.next
+		print "Length: ", cnt
+
+	def middle(self):
+		print "Middle"
+		temp1 = self.head
+		temp2 = self.head
+		while temp2.next:
+			temp2 = temp2.next.next
+			temp1 =	temp1.next
+		print temp1.key
+
+	def count_key(self, key, temp, freq=0):
+		if not temp:
+			return freq
+		if temp.key == key:
+			freq+=1
+		return self.count_key(key, temp.next, freq)
+
 list_ = LinkedList()
 list_.push(2)
 list_.push(5)
 list_.push(8)
 list_.push(9)
 list_.push(1)
-list_.push(3)
+list_.push(4)
 list_.push(6)
 list_.push(4)
 list_.push(7)
@@ -65,6 +96,12 @@ def pop_key(self, key):
 list_.pop_key(6)
 print "\n"
 list_.traverse()
+list_.len()
+list_.middle()
+print "Number of Times Key occur: ",list_.count_key(4, list_.head)
+list_.delete_linked_list()
+list_.traverse()
+list_.len()