From 84b35ceaf32c18e36c3a959fb0992e6c6476b049 Mon Sep 17 00:00:00 2001
From: marina <138340846+bt3gl-cryptographer@users.noreply.github.com>
Date: Thu, 3 Aug 2023 13:18:57 -0700
Subject: [PATCH] Update and rename preorder_transversal.py to
 bt_preorder_transversal.py

---
 .../{preorder_transversal.py => bt_preorder_transversal.py}  | 5 ++---
 1 file changed, 2 insertions(+), 3 deletions(-)
 rename trees/{preorder_transversal.py => bt_preorder_transversal.py} (78%)

diff --git a/trees/preorder_transversal.py b/trees/bt_preorder_transversal.py
similarity index 78%
rename from trees/preorder_transversal.py
rename to trees/bt_preorder_transversal.py
index 9e2f7bc..c186d27 100644
--- a/trees/preorder_transversal.py
+++ b/trees/bt_preorder_transversal.py
@@ -2,9 +2,8 @@
 # -*- coding: utf-8 -*-
 # author: bt3gl
 
-# recursive and iterative inorder traversal
 
-def preorder_recursive(root: Optional[TreeNode]) -> list[int]:
+def preorder_recursive(root: Optional[Node]) -> list[int]:
        
         if root == None:
                 return []
@@ -12,7 +11,7 @@ def preorder_recursive(root: Optional[TreeNode]) -> list[int]:
         return [root.val] + preorder_recursive(root.left) + preorder_recursive(root.right)
     
 
-def preorder_iterative(root: Optional[TreeNode]) -> list[int]:
+def preorder_iterative(root: Optional[Node]) -> list[int]:
         
         result = []
         stack = [root]