INVERT BINARY TREE | LEETCODE # 226 | PYTHON SOLUTION

[@subee128]

Thank you very much

[@pieceofpop5554]

awesome sauce

[@translatingIdeasIntoCoding]

Space complexity must be O(d), where d is depth of tree imho. d can vary between log N and N. Do you agree?

[@lavanya_m01]

In case of a skewed tree, it might take O(N). Since we always take the worst case for space complexity, we say O(N)