diff --git a/trees/bst_inorder_iterator.py b/trees/bt_inorder_iterator.py
similarity index 86%
rename from trees/bst_inorder_iterator.py
rename to trees/bt_inorder_iterator.py
index 3bbf05b..65ee45a 100644
--- a/trees/bst_inorder_iterator.py
+++ b/trees/bt_inorder_iterator.py
@@ -8,29 +8,24 @@ class Node:
       self.left = left
       self.right = right
 
+
 class BST_Iterator:
 
-    def __init__(self, root: Optional[Node]):
-        
+    def __init__(self, root):
         self.stack = []
         self.left_inorder(root)
         
     def left_inorder(self, root):
-        
         while root:
             self.stack.append(root)
             root = root.left
 
     def next(self) -> int:
-        
         top_node = self.stack.pop()
-        
         if top_node.right:
             self.left_inorder(top_node.right)
-        
         return top_node.val
         
     def has_next(self) -> bool:
-        
         return len(self.stack) > 0