Added max_sum_bst.py

data_structures/binary_tree/maximum_sum_bst.py

@@ -1,12 +1,14 @@
 from dataclasses import dataclass
 from typing import Optional
 
 
+
 @dataclass
 class TreeNode:
  val: int = 0
- left: Optional['TreeNode'] = None
- right: Optional['TreeNode'] = None
+ left: Optional["TreeNode"] = None
+ right: Optional["TreeNode"] = None
+
 
 def max_sum_bst(root: TreeNode) -> int:
  """
@@ -40,7 +42,7 @@
  """
  ans = 0
 
  def solver(node: Optional[TreeNode]) -> tuple[bool, int, int, int]:
  """
  Returns the maximum sum by making recursive calls
  """