Updated code

Author: 1227haran

data_structures/binary_tree/maximum_sum_bst.py

@@ -12,7 +12,7 @@ class TreeNode:
     right: 'TreeNode' = None
 
 
-def max_sum_bst(root: TreeNode | None) -> int:
+def max_sum_bst(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
@@ -44,7 +44,7 @@ def max_sum_bst(root: TreeNode | None) -> int:
     """
     ans: int = 0
 
-    def solver(node: TreeNode | None) -> tuple[bool, int, int, int]:
+    def solver(node: TreeNode) -> tuple[bool, int, int, int]:
         """
         Returns the maximum sum by making recursive calls
         >>> t1 = TreeNode(1)