refactor

AntiHero · AntiHero · commit f5655fef9496 · 2021-05-11T00:39:56.000+03:00
diff --git a/branch_sums.py b/branch_sums.py
@@ -1,6 +1,5 @@
 from utils import bst
 
-# binary search tree
 tree = bst.BSTNode(11)
 
 tree.insert(7)
diff --git a/find_the_closest_value_in_BST.py b/find_the_closest_value_in_BST.py
@@ -16,7 +16,6 @@
 
 
 # Avg O(log(n)) time | Worst O(n) time | Avg O(log(n)) space | Worst O(n) space
-
 def find_closest_value_in_bst1(btree, target):
     return find_closest_value_in_bst_helper1(btree, target, float("inf"))
 
