We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent f1c5829 commit cbc759bCopy full SHA for cbc759b
data_structures/binary_tree/maximum_sum_bst.py
@@ -44,7 +44,7 @@ def max_sum_bst(root: TreeNode) -> int:
44
"""
45
ans: int = 0
46
47
- def solver(node: 'TreeNode' | None) -> tuple[bool, int, int, int]:
+ def solver(node: "TreeNode" | None) -> tuple[bool, int, int, int]:
48
49
Returns the maximum sum by making recursive calls
50
>>> t1 = TreeNode(1)
0 commit comments