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