diff --git a/trees/tree_bfs.py b/trees/bt_bfs.py
similarity index 77%
rename from trees/tree_bfs.py
rename to trees/bt_bfs.py
index 6317eff..df01479 100644
--- a/trees/tree_bfs.py
+++ b/trees/bt_bfs.py
@@ -2,11 +2,8 @@
 # -*- coding: utf-8 -*-
 # author: bt3gl
 
-# Given the root of a binary tree, return the level order traversal of its nodes' values. 
-# (i.e., from left to right, level by level).
 
-
-def level_order(root: Optional[TreeNode]) -> list[list[int]]:
+def level_order(root: Optional[Node]) -> list[list[int]]:
         
         if root is None:
             return []