Merge pull request #259 from Gunnika/master

Addition of Linked List algorithms

Author: probot-auto-merge[bot]

Linked List/Delete_node_from_LL.py

@@ -0,0 +1,68 @@
+class Node:
+	def __init__(self, data):
+		self.data = data
+		self.next = None
+
+class LinkedList:
+	def __init__(self):
+		self.head = None
+
+	def DeleteNode(self, value):
+		if self.head==None:
+			print('Empty List')
+		else:
+			prev = None
+			curr = self.head 
+			while(curr):
+				if curr.data == value:
+					if prev:
+						prev.next = curr.next
+					else:
+						self.head = curr.next
+					return True
+				prev = curr
+				curr = curr.next
+			return False
+	
+			
+
+	def push(self, new_node):
+		if not self.head:
+			self.head = new_node
+		else:
+			current=self.head
+			while(current.next):
+				current = current.next
+			current.next = new_node
+			new_node.next = None 
+
+
+
+	def printlist(self):
+		curr = self.head
+		while(curr):
+			print(curr.data)
+			curr = curr.next
+
+# driver code
+llist = LinkedList()
+newval = Node(2)
+llist.push(newval)
+newval = Node(6)
+llist.push(newval)
+newval = Node(1)
+llist.push(newval)
+newval = Node(5)
+llist.push(newval)
+print("Created Linked List")
+llist.printlist()
+if(llist.DeleteNode(1)):
+	print('Deleted')
+else:
+	print("Node not found")
+llist.printlist()
+if(llist.DeleteNode(9)):
+	print('Deleted')
+else:
+	print("Node not found")
+llist.printlist()

Linked List/Sorted_insertion_in_LL.py

@@ -0,0 +1,56 @@
+class Node:
+	def __init__(self, data):
+		self.val = data
+		self.next = None
+
+class LinkedList:
+	def __init__(self):
+		self.head = None
+
+	def sortedInsert(self, new_node):
+		if not self.head:
+			new_node.next=self.head
+			self.head = new_node
+
+		elif new_node.val <= self.head.val : 
+			new_node.next = self.head
+			self.head = new_node
+
+		else:
+			current = self.head
+			while(current.next is not None and current.next.val < new_node.val):
+				current = current.next
+			new_node.next = current.next
+			current.next = new_node
+
+	def push(self, data):
+		new_node = Node(data)
+		new_node.next = self.head
+		self.head = new_node
+
+	def printList(self):
+		temp = self.head
+		while(temp):
+			print(temp.val)
+			temp = temp.next
+
+# driver code
+llist = LinkedList() 
+new_node = Node(5) 
+llist.sortedInsert(new_node) 
+new_node = Node(10) 
+llist.sortedInsert(new_node) 
+new_node = Node(7) 
+llist.sortedInsert(new_node) 
+new_node = Node(3) 
+llist.sortedInsert(new_node) 
+new_node = Node(1) 
+llist.sortedInsert(new_node) 
+new_node = Node(9) 
+llist.sortedInsert(new_node) 
+print("Create Linked List")
+llist.printList() 
+new_node = Node(4)
+llist.sortedInsert(new_node)
+print("Updated")
+llist.printList()