update

Author: sinanazem

data-structure/trees/binary_search_tree.py

@@ -0,0 +1,104 @@
+class BinarySearchTree:
+ 
+ def __init__(self, data):
+ self.data = data
+ self.left = None
+ self.right = None
+ 
+ def search(self, value):
+ if self.data == value:
+ return True
+ if self.data > value:
+ if self.left:
+ return self.left.search(value)
+ else:
+ return False
+ 
+ else:
+ if self.right:
+ return self.right.search(value)
+ else:
+ return False
+ 
+ 
+ def add(self, value):
+ 
+ if self.data == value:
+ return 
+ if self.data > value:
+ if self.left == None:
+ self.left = BinarySearchTree(value)
+ 
+ else:
+ self.left.add(value) 
+ else:
+ if self.right == None:
+ self.right = BinarySearchTree(value)
+ else:
+ self.right.add(value)
+ 
+ def inorder_traversal(self):
+ # Left-Node-Right -> LNR
+ elements = []
+ if self.left:
+ elements += self.left.inorder_traversal()
+ elements.append(self.data)
+ if self.right:
+ elements += self.right.inorder_traversal()
+ return elements
+ 
+ def preorder_traversal(self):
+ # Node-Left-Right -> NLR
+ 
+ elements = []
+ elements.append(self.data)
+ if self.left:
+ elements += self.left.preorder_traversal()
+ 
+ if self.right:
+ elements += self.right.preorder_traversal()
+ return elements
+ 
+ def postorder_traversal(self):
+ # Left-Right-Node -> LRN
+ 
+ elements = []
+ 
+ if self.left:
+ elements += self.left.postorder_traversal()
+ if self.right:
+ elements += self.right.postorder_traversal()
+ 
+ elements.append(self.data)
+
+ return elements
+ 
+ def reverse(self):
+ self.left, self.right = self.right, self.left
+ if self.left:
+ self.left.reverse()
+ if self.right:
+ self.right.reverse()
+ 
+ 
+ 
+if __name__ == "__main__":
+ elements = [15, 12, 27, 7, 14, 20, 88, 23]
+ root = BinarySearchTree(15)
+ for element in elements:
+ root.add(element)
+ 
+ # print(root.data)
+ # print(root.left.data)
+ # print(root.left.left.data)
+ # print(root.left.right.data)
+ # print(root.right.left.right.data)
+ print(root.inorder_traversal())
+ print(root.preorder_traversal())
+ print(root.postorder_traversal())
+ 
+ print(root.search(88))
+ print(root.search(212))
+ root.reverse()
+ print(root.inorder_traversal())
+ 

data-structure/trees/binary_tree.py

@@ -0,0 +1,109 @@
+{
+ "cells": [
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "# Recursion in Python"
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 1,
+ "metadata": {},
+ "outputs": [],
+ "source": [
+ "def function():\n",
+ " x = 10\n",
+ " function()"
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 2,
+ "metadata": {},
+ "outputs": [
+ {
+ "ename": "RecursionError",
+ "evalue": "maximum recursion depth exceeded",
+ "output_type": "error",
+ "traceback": [
+ "\u001b[0;31m---------------------------------------------------------------------------\u001b[0m",
+ "\u001b[0;31mRecursionError\u001b[0m Traceback (most recent call last)",
+ "Cell \u001b[0;32mIn[2], line 1\u001b[0m\n\u001b[0;32m----> 1\u001b[0m \u001b[43mfunction\u001b[49m\u001b[43m(\u001b[49m\u001b[43m)\u001b[49m\n",
+ "Cell \u001b[0;32mIn[1], line 3\u001b[0m, in \u001b[0;36mfunction\u001b[0;34m()\u001b[0m\n\u001b[1;32m 1\u001b[0m \u001b[38;5;28;01mdef\u001b[39;00m \u001b[38;5;21mfunction\u001b[39m():\n\u001b[1;32m 2\u001b[0m x \u001b[38;5;241m=\u001b[39m \u001b[38;5;241m10\u001b[39m\n\u001b[0;32m----> 3\u001b[0m \u001b[43mfunction\u001b[49m\u001b[43m(\u001b[49m\u001b[43m)\u001b[49m\n",
+ "Cell \u001b[0;32mIn[1], line 3\u001b[0m, in \u001b[0;36mfunction\u001b[0;34m()\u001b[0m\n\u001b[1;32m 1\u001b[0m \u001b[38;5;28;01mdef\u001b[39;00m \u001b[38;5;21mfunction\u001b[39m():\n\u001b[1;32m 2\u001b[0m x \u001b[38;5;241m=\u001b[39m \u001b[38;5;241m10\u001b[39m\n\u001b[0;32m----> 3\u001b[0m \u001b[43mfunction\u001b[49m\u001b[43m(\u001b[49m\u001b[43m)\u001b[49m\n",
+ " \u001b[0;31m[... skipping similar frames: function at line 3 (2970 times)]\u001b[0m\n",
+ "Cell \u001b[0;32mIn[1], line 3\u001b[0m, in \u001b[0;36mfunction\u001b[0;34m()\u001b[0m\n\u001b[1;32m 1\u001b[0m \u001b[38;5;28;01mdef\u001b[39;00m \u001b[38;5;21mfunction\u001b[39m():\n\u001b[1;32m 2\u001b[0m x \u001b[38;5;241m=\u001b[39m \u001b[38;5;241m10\u001b[39m\n\u001b[0;32m----> 3\u001b[0m \u001b[43mfunction\u001b[49m\u001b[43m(\u001b[49m\u001b[43m)\u001b[49m\n",
+ "\u001b[0;31mRecursionError\u001b[0m: maximum recursion depth exceeded"
+ ]
+ }
+ ],
+ "source": [
+ "function()"
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 3,
+ "metadata": {},
+ "outputs": [],
+ "source": [
+ "def countdown(n):\n",
+ " print(n)\n",
+ " if n > 0:\n",
+ " countdown(n - 1)"
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 4,
+ "metadata": {},
+ "outputs": [
+ {
+ "name": "stdout",
+ "output_type": "stream",
+ "text": [
+ "5\n",
+ "4\n",
+ "3\n",
+ "2\n",
+ "1\n",
+ "0\n"
+ ]
+ }
+ ],
+ "source": [
+ "countdown(5)"
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": null,
+ "metadata": {},
+ "outputs": [],
+ "source": []
+ }
+ ],
+ "metadata": {
+ "kernelspec": {
+ "display_name": "ml_env",
+ "language": "python",
+ "name": "python3"
+ },
+ "language_info": {
+ "codemirror_mode": {
+ "name": "ipython",
+ "version": 3
+ },
+ "file_extension": ".py",
+ "mimetype": "text/x-python",
+ "name": "python",
+ "nbconvert_exporter": "python",
+ "pygments_lexer": "ipython3",
+ "version": "3.9.18"
+ }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}