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