[pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

Author: pre-commit-ci[bot]

data_structures/binary_tree/max_sum_BST.py

@@ -4,8 +4,8 @@ def __init__(self, val=0, left=None, right=None):
         self.left = left
         self.right = right
 
-def maxSumBST(root: TreeNode) -> int:
 
+def maxSumBST(root: TreeNode) -> int:
     """
     The solution traverses a binary tree to find the maximum sum of
     keys in any subtree that is a Binary Search Tree (BST). It uses
@@ -39,30 +39,25 @@ def maxSumBST(root: TreeNode) -> int:
 
     def solver(node):
         nonlocal ans
-            
+
         if not node:
-            return True, float('inf'), float('-inf'), 0  # Valid BST, min, max, sum
-            
+            return True, float("inf"), float("-inf"), 0  # Valid BST, min, max, sum
+
         isLeftValid, min_left, max_left, sum_left = solver(node.left)
         isRightValid, min_right, max_right, sum_right = solver(node.right)
 
         if isLeftValid and isRightValid and max_left < node.val < min_right:
             total_sum = sum_left + sum_right + node.val
             ans = max(ans, total_sum)
             return True, min(min_left, node.val), max(max_right, node.val), total_sum
-            
+
         return False, -1, -1, -1  # Not a valid BST
 
     solver(root)
     return ans
-    
-if __name__ == "__main__":
-
-    import doctest
-    doctest.testmod()
-
-
-
 
 
+if __name__ == "__main__":
+    import doctest
 
+    doctest.testmod()