Update

Author: Sonawane-Karan26

Chapter06/binary_search_tree.py

@@ -12,7 +12,7 @@ def insert(self, data):
         node = Node(data)
         if self.root_node is None:
             self.root_node = node
-            return
+            return self.root_node
         else:
             current = self.root_node
             parent = None
@@ -22,20 +22,20 @@ def insert(self, data):
                     current = current.left_child
                     if current is None:
                         parent.left_child = node
-                        return
+                        return self.root_node
                 else:
                     current = current.right_child
                     if current is None:
                         parent.right_child = node
-                        return
+                        return self.root_node
 
-    def inorder(self): 
-        current = self.root_node 
+    def inorder(self, root_node): 
+        current = root_node 
         if current is None: 
             return 
-        inorder(current.left_child) 
+        self.inorder(current.left_child) 
         print(current.data) 
-        inorder(current.right_child)
+        self.inorder(current.right_child)
 
 
     def get_node_with_parent(self, data): 
@@ -112,8 +112,10 @@ def search(self, data):
         current = self.root_node
         while True:
             if current is None:
+                print("Item not found")
                 return None
             elif current.data is data:
+                print("Item found", data)
                 return data
             elif current.data > data:
                 current = current.left_child
@@ -136,21 +138,29 @@ def find_max(self):
 
 
 
+tree = Tree()
+r = tree.insert(5)
+r = tree.insert(2)
+r = tree.insert(7)
+r = tree.insert(9)
+r = tree.insert(1)
+
+tree.inorder(r)
+
+
+
+tree.search(9)      
+
+
+tree.remove(9)  
+tree.search(9)
+
 tree = Tree()
 tree.insert(5)
 tree.insert(2)
 tree.insert(7)
 tree.insert(9)
 tree.insert(1)
 
-tree.inorder()
-
-for i in range(1, 10):
-    found = tree.search(i)
-    print("{}: {}".format(i, found))
-    
-    
-print(tree.find_min())   
-
-print(tree.find_max())   
-      
+print(tree.find_min()) 
+print(tree.find_max()) 

Chapter10/binary_search_recursive.py

@@ -12,8 +12,7 @@ def binary_search_recursive(ordered_list, first_element_index, last_element_inde
             return mid_point  
 
 
-store = [2, 4, 5, 12, 43, 54, 60, 77] 
-print(binary_search_recursive(store, 0, 7, 12))
+ 
 
 
 

Chapter10/jump_search.py

@@ -10,33 +10,34 @@ def search_ordered(ordered_list, term):
 
 
 
-def jump_search(A, item): 
+def jump_search(ordered_list, item): 
+    import math
     print("Entering Jump Search") 
-    n = len(A)                           
-    m = int(math.sqrt(n))          
+    list_size = len(ordered_list)                           
+    block_size = int(math.sqrt(list_size))          
     i = 0                                
-    while i != len(A)-1 and A[i] <= item: 
-        print("Block under consideration - {}".format(A[i: i+m])) 
-        if i+m > len(A): 
-            m =  len(A) - i 
-            B = A[i: i+m] 
-            j = search_ordered(B, item) 
+    while i != len(ordered_list)-1 and ordered_list[i] <= item: 
+        print("Block under consideration - {}".format(ordered_list[i: i+block_size])) 
+        if i+ block_size > len(ordered_list): 
+            block_size =  len(ordered_list) - i 
+            block_list = ordered_list[i: i+block_size] 
+            j = search_ordered(block_list, item) 
             if j == -1: 
                 print("Element not found") 
                 return  
             return i + j 
-        if A[i+m-1] == item:            
-            return i+m-1 
-        elif A[i+m-1] > item:            
-            B = A[i: i+m-1] 
-            j = search_ordered(B, item) 
+        if ordered_list[i + block_size -1] == item:            
+            return i+block_size-1 
+        elif ordered_list[i + block_size - 1] > item:            
+            block_array = ordered_list[i: i + block_size - 1] 
+            j = search_ordered(block_array, item) 
             if j == -1: 
                 print("Element not found") 
-                return    
+                return   
             return i + j 
-        i += m
+        i += block_size
 
 
 
-print(jump_search([1,2,3,4,5,6,7,8,9, 10, 11], 10))
+print(jump_search([1,2,3,4,5,6,7,8,9, 10, 11], 8))