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