From 2ff7bc2cafdde8c8a2cf89afac79ddeb11610cdf Mon Sep 17 00:00:00 2001
From: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Date: Sun, 3 May 2020 14:22:41 +0000
Subject: [PATCH] fixup! Format Python code with psf/black push

---
 data_structures/binary_tree/segment_tree_other.py | 13 +++++++++----
 data_structures/stacks/stack.py                   |  5 ++---
 2 files changed, 11 insertions(+), 7 deletions(-)

diff --git a/data_structures/binary_tree/segment_tree_other.py b/data_structures/binary_tree/segment_tree_other.py
index 93b603cdc7a2..c3ab493d5f4f 100644
--- a/data_structures/binary_tree/segment_tree_other.py
+++ b/data_structures/binary_tree/segment_tree_other.py
@@ -18,7 +18,7 @@ def __init__(self, start, end, val, left=None, right=None):
         self.right = right
 
     def __str__(self):
-        return 'val: %s, start: %s, end: %s' % (self.val, self.start, self.end)
+        return "val: %s, start: %s, end: %s" % (self.val, self.start, self.end)
 
 
 class SegmentTree(object):
@@ -131,6 +131,7 @@ class SegmentTree(object):
     >>>
 
     """
+
     def __init__(self, collection: Sequence, function):
         self.collection = collection
         self.fn = function
@@ -197,7 +198,10 @@ def _query_range(self, node, i, j):
                 return self._query_range(node.left, i, j)
             else:
                 # range in left child tree and right child tree
-                return self.fn(self._query_range(node.left, i, node.mid), self._query_range(node.right, node.mid + 1, j))
+                return self.fn(
+                    self._query_range(node.left, i, node.mid),
+                    self._query_range(node.right, node.mid + 1, j),
+                )
         else:
             # range in right child tree
             return self._query_range(node.right, i, j)
@@ -217,10 +221,11 @@ def traverse(self):
                     queue.put(node.right)
 
 
-if __name__ == '__main__':
+if __name__ == "__main__":
     import operator
+
     for fn in [operator.add, max, min]:
-        print('*' * 50)
+        print("*" * 50)
         arr = SegmentTree([2, 1, 5, 3, 4], fn)
         for node in arr.traverse():
             print(node)
diff --git a/data_structures/stacks/stack.py b/data_structures/stacks/stack.py
index a96275aa8df2..baa0857eec0a 100644
--- a/data_structures/stacks/stack.py
+++ b/data_structures/stacks/stack.py
@@ -46,11 +46,11 @@ def is_empty(self):
     def size(self):
         """ Return the size of the stack."""
         return len(self.stack)
-    
+
     def __contains__(self, item) -> bool:
         """Check if item is in stack"""
         return item in self.stack
-    
+
 
 class StackOverflowError(BaseException):
     pass
@@ -73,4 +73,3 @@ class StackOverflowError(BaseException):
     num = 5
     if num in stack:
         print(f"{num} is in stack")
-