[pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

Author: pre-commit-ci[bot]

data_structures/binary_tree/binary_tree_maximum_path_sum.py

@@ -26,7 +26,6 @@ def __init__(self, val: int, left=None, right=None) -> None:
 
 
 class GetMaxPathSum:
-
     r"""
 
     GetMaxPathSum takes root node of a tree as initial argument.
@@ -67,7 +66,6 @@ def __init__(self, root):
         self.root = root
 
     def traverse(self, root: TreeNode) -> int:
-
         """
         Returns maximum path sum by recursively taking max_path_sum from left
         and max_path_sum from right if current Node has a left or right Node.
@@ -88,7 +86,6 @@ def traverse(self, root: TreeNode) -> int:
         return root.val + max(right_sum, left_sum)
 
     def max_path_sum(self) -> int:
-
         """
         Driver method to get max_path_sum by calling traverse method.
         :return max_path_sum:
@@ -115,7 +112,7 @@ def construct_tree() -> TreeNode:
     return root
 
 
-if __name__ == '__main__':
+if __name__ == "__main__":
     import doctest
 
     tree = GetMaxPathSum(construct_tree())