diff --git a/python/topics/Network-Flow-Problem/Ford-Fulkerson-max-flow.py b/python/topics/Network-Flow-Problem/Ford-Fulkerson-max-flow.py
index 8800d11..558bf87 100644
--- a/python/topics/Network-Flow-Problem/Ford-Fulkerson-max-flow.py
+++ b/python/topics/Network-Flow-Problem/Ford-Fulkerson-max-flow.py
@@ -11,7 +11,6 @@ def __init__(self, graph):
     def bfs(self, s, t, parent):
         """Returns true if there is a path from source 's' to sink 't' in
         residual graph. Also fills parent[] to store the path."""
-
         # Mark all the vertices as not visited
         visited = [False] * self.row
 
diff --git a/python/topics/geometry/convex-hull.py b/python/topics/geometry/convex-hull.py
index 46f482c..c5db1a7 100644
--- a/python/topics/geometry/convex-hull.py
+++ b/python/topics/geometry/convex-hull.py
@@ -6,7 +6,6 @@ def convex_hull(points):
       starting from the vertex with the lexicographically smallest coordinates.
     Implements Andrew's monotone chain algorithm. O(n log n) complexity.
     """
-
     # Sort the points lexicographically (tuples are compared lexicographically).
     # Remove duplicates to detect the case we have just one unique point.
     points = sorted(set(points))
diff --git a/python/tree/bfs_traversal.py b/python/tree/bfs_traversal.py
index 80404fd..dc23c27 100644
--- a/python/tree/bfs_traversal.py
+++ b/python/tree/bfs_traversal.py
@@ -23,7 +23,6 @@ def printLevelOrder(root):
     >>> printLevelOrder(root)
     [1, 2, 3, 4, 5, 6, 7]
     """
-
     # Base Case
     if root is None:
         return