leetcode
110. Balanced Binary Tree
Solution code: O(n)
Time complexity: O(n)
h = height of tree
Space complexity: O(h)
Solution code: O(n log(n))
Time complexity: O(n log(n))
h = height of tree
Space complexity: O(h)