We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
2 parents c2a62d9 + bae1df8 commit 8df7748Copy full SHA for 8df7748
data_structures/binary_tree/maximum_sum_bst.py
@@ -13,7 +13,7 @@ class TreeNode:
13
right: Optional['TreeNode'] = None
14
15
16
-def max_sum_bst(root: TreeNode ) -> int:
+def max_sum_bst(root: TreeNode) -> int:
17
"""
18
The solution traverses a binary tree to find the maximum sum of
19
keys in any subtree that is a Binary Search Tree (BST). It uses
0 commit comments