fixes: TheAlgorithms#2172

Author: SiddhantBobde

data_structures/binary_tree/binary_search_tree.py

@@ -141,17 +141,18 @@ def traversal_tree(self, traversal_function=None):
         else:
             return traversal_function(self.root)
 
-    def inorder(self,arr,Node):
+    def inorder(self, arr, Node):
         if Node:
-            self.inorder(arr,Node.left)
+            self.inorder(arr, Node.left)
             arr.append(Node.value)
-            self.inorder(arr,Node.right)
+            self.inorder(arr, Node.right)
 
-    def find_Kth_Smallest(self,k,Node):
-        arr=[]
-        self.inorder(arr,Node)
+    def find_Kth_Smallest(self, k, Node):
+        arr = []
+        self.inorder(arr, Node)
         arr.sort()
-        return arr[k-1]
+        return arr[k - 1]
+
 
 def postorder(curr_node):
     """