Skip to content

Conversation

@MariaWissler
Copy link

No description provided.

Copy link

@CheezItMan CheezItMan left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Not bad, a few issues, but check out my comments and let me know any questions you have.

# Space Complexity: O(h)
def height
raise NotImplementedError
#raise NotImplementedError

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Nice try at an iterative solution. It's easier to do recursively. This solution doesn't work.

Remember the height of a subtree is the max of the height of the left subtree compared to the height of the right subtree plus one.

# Optional Method
# Time Complexity:
# Space Complexity:
# Time Complexity: O(log h) if balanced

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Since you are building a Queue and sift the 1st element of the queue off at each iteration, this is O(n2)

Also since you are building an array, the space complexity is O(n)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants