Add 8 new programs

SaadOps · SaadOps · commit a17da3d3f916 · 2022-10-05T12:00:23.000+05:30
diff --git a/binary_search_tree.py b/binary_search_tree.py
@@ -0,0 +1,32 @@
+class Node:
+    def __init__(self, val):
+        self.value = val
+        self.left = None
+        self.right = None
+
+def binsert(root, data):
+    if root is None:
+        return Node(data)
+
+    if data < root.value:
+        root.left = binsert(root.left, data)
+    elif data > root.value:
+        root.right = binsert(root.right, data)    
+    else:
+        print(f"{data} already exists")
+    return root
+
+def inorder(root):
+    if root:
+        inorder(root.left)
+        print(root.value, end=" ")
+        inorder(root.right)
+
+b = Node(100)
+print("Root Node:",b.value)
+binsert(b, 30)
+binsert(b, 3)
+binsert(b, 200)
+binsert(b, 10)
+print("Inorder of Traversal of the tree:")
+inorder(b)
diff --git a/insertion_sort.py b/insertion_sort.py
@@ -0,0 +1,18 @@
+def insertionsort(arr):
+
+    for i in range(1,len(arr)):
+        temp = arr[i]
+        j = i - 1
+
+        while (j >= 0 and temp < arr[j]):
+            arr[j+1] = arr[j]
+            j -=1
+        
+        arr[j+1] = temp
+
+
+array = [8, 2, 7, 10, 9, 1, 0]  
+print("Array before sorting:\n", array)
+
+insertionsort(array)
+print("Array after sorting:\n",array)
diff --git a/linear_search.py b/linear_search.py
@@ -0,0 +1,13 @@
+def linearsearch(lst, x):
+
+    for i in range(len(lst)):
+        if lst[i] == x:
+            return f'Element {x} found at index {i}'
+
+    return 'Element not found in the list.'
+
+list_in = list(map(int, input("Enter integers seperated by space: ").split()))
+x = int(input("Enter X: "))
+
+print(list_in)
+print(linearsearch(list_in, x))
diff --git a/linked_list.py b/linked_list.py
@@ -0,0 +1,98 @@
+class Node:
+    def __init__(self, data):
+        self.data = data
+        self.ref = None
+
+
+class LinkedList:
+    def __init__(self):
+        self.head = None
+    
+    def add_begin(self, data):
+        new_node = Node(data)           
+        new_node.ref = self.head
+        self.head = new_node            
+
+    def add_end(self, data):
+        new_node = Node(data)
+        if self.head is None:
+            self.head = new_node
+        else:
+            n = self.head
+            while n.ref is not None:
+                n = n.ref
+            n.ref = new_node
+
+    def add_after(self, after, data):
+        n = self.head
+
+        while n is not None:
+            if n.data == after:
+                break
+            else:
+                n = n.ref
+        
+        if n is None:
+            print("Node is not present in Linked List")
+        else:
+            new_node = Node(data)
+            new_node.ref = n.ref
+            n.ref = new_node
+
+    def printl2(self):
+        if self.head is None:
+            print("Linked List is empty")
+        
+        else:
+            n = self.head
+            while n is not None:
+                print(n.data, '-->', end = ' ')
+                n = n.ref
+
+    def del_begin(self):
+        if self.head is None:
+            print("delete operation is not possible")
+        else:
+            self.head = self.head.ref
+        
+    def del_end(self):
+        if self.head is None:
+            print("delete operation is not possible")
+        else:
+            n = self.head
+            while n.ref.ref is not None:
+                n = n.ref
+            n.ref = None
+
+    def del_node(self, node):
+        if self.head == None:
+            print("deletion operation is not possibe")
+        elif self.head.data == node:
+            self.del_begin()
+        else:    
+            n = self.head
+            while n.ref is not None:
+                if n.ref.data == node:
+                    break
+                else:
+                    n = n.ref
+            
+            if n.ref is None:
+                print("Can't delete a node that doesn't exist")
+            else:
+                n.ref = n.ref.ref
+
+
+l = LinkedList()
+l.add_begin(10)
+l.add_begin(5)
+l.add_begin(1)
+l.add_end(15)
+l.add_after(5, 12)
+l.add_after(10, 0)
+l.printl2()
+print("")
+l.del_begin()
+l.del_end()
+l.del_node(12)
+l.printl2()
diff --git a/postfixeval.py b/postfixeval.py
@@ -0,0 +1,32 @@
+class Stack:
+
+    def __init__(self):
+        self.stack = []
+
+    def push(self, val):
+        self.stack.append(val)
+
+    def pop_(self):
+        if not self.stack:
+            return
+        else:
+            return self.stack.pop()
+
+def posteval(expression):
+    stk = Stack()
+    for i in expression:
+        if i.isdigit():
+            stk.push(i)
+        else:
+            a = int(stk.pop_())
+            b = int(stk.pop_())
+            if i == '^':
+                temp = f'{b}**{a}'
+                stk.push(str(eval(temp)))
+            else:
+                temp = f'{b}{i}{a}'
+                stk.push(eval(temp))
+    return stk.stack[0]
+
+postfix = input("Enter postfix expression: ")
+print(posteval(postfix))
diff --git a/queue.py b/queue.py
@@ -0,0 +1,25 @@
+from collections import deque
+queue = deque()
+
+def enqueue():
+    x = input("Enter an element: ")
+    queue.append(x)
+    print(list(queue))
+
+def dq():
+    if not queue:
+        print("Can't perform pop on empty queue.")
+    else:
+        print("Popped element: ", queue.popleft())
+        print(list(queue))
+
+while True:
+    ch = int(input("1.enqueue, 2. dequeue, 3. quit \nEnter: "))
+    if ch == 1:
+        enqueue()
+    elif ch == 2:
+        dq()
+    elif ch == 3:
+        break
+    else:
+        print("Invalid operation!")
diff --git a/selection_sort.py b/selection_sort.py
@@ -0,0 +1,18 @@
+def selectionsort(arr):
+    
+    for i in range(len(arr)):
+        minimum = i
+
+        for j in range(i+1, len(arr)):
+            if arr[j] < arr[minimum]:
+                minimum = j
+
+        arr[i], arr[minimum] = arr[minimum], arr[i]
+
+
+array = [99, 10, 29, 90, 100, 38, 2938, 23, 498]
+print("Array before sorting:\n", array)
+selectionsort(array)
+print("Array after sorting:\n",array)
+
+
diff --git a/stack.py b/stack.py
@@ -0,0 +1,24 @@
+stack = []
+
+def push():
+    x = input("Enter an element: ")
+    stack.append(x)
+    print(stack)
+
+def pop_():
+    if not stack:
+        print("Can't perform pop on empty stack.")
+    else:
+        print("Popped element ", stack.pop())
+        print(stack)
+
+while True:
+    ch = int(input("1.push, 2. pop, 3. quit \nEnter: "))
+    if ch == 1:
+        push()
+    elif ch == 2:
+        pop_()
+    elif ch == 3:
+        break
+    else:
+        print("Invalid operation!")
