We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent a0657c7 commit 29f8dadCopy full SHA for 29f8dad
Python/balanced-binary-tree.py
@@ -1,5 +1,5 @@
1
# Time: O(n)
2
-# Space: O(logn)
+# Space: O(h), h is height of binary tree
3
#
4
# Given a binary tree, determine if it is height-balanced.
5
0 commit comments