Skip to content

Commit bae1df8

Browse files
[pre-commit.ci] auto fixes from pre-commit.com hooks
for more information, see https://pre-commit.ci
1 parent 7d1f92a commit bae1df8

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

data_structures/binary_tree/maximum_sum_bst.py

+1-1
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,7 @@ class TreeNode:
1212
right: "TreeNode" = None
1313

1414

15-
def max_sum_bst(root: TreeNode ) -> int:
15+
def max_sum_bst(root: TreeNode) -> int:
1616
"""
1717
The solution traverses a binary tree to find the maximum sum of
1818
keys in any subtree that is a Binary Search Tree (BST). It uses

0 commit comments

Comments
 (0)