diff --git a/Python/increasing-subsequences.py b/Python/increasing-subsequences.py
index 6639959bc..08f2b53dc 100644
--- a/Python/increasing-subsequences.py
+++ b/Python/increasing-subsequences.py
@@ -1,5 +1,5 @@
 # Time:  O(n * 2^n)
-# Space: O(n^2)
+# Space: O(n) #Longest possible path in tree, which is if all numbers are increasing.
 
 # Given an integer array, your task is
 # to find all the different possible increasing