binary_search_tree #45
Conversation
|
Grabbing this to grade! |
| return None | ||
|
|
||
| # Time Complexity: O(log n) | ||
| # Space Complexity: O(log n) |
There was a problem hiding this comment.
Good news! Since you did an iterative implementation of find, you don't take the hit of the extra stack frames you get from recursion, so your space complexity here is actually O(1), since no new memory is allocated.
| return self.inorder_helper_function(self.root, values) | ||
|
|
||
| # Time Complexity: O(log n) | ||
| # Space Complexity: O(log n) |
There was a problem hiding this comment.
Note that unlike add and find where you only traverse down one branch of the tree, with the depth-first traversals, you do travel to every node in the tree, bumping up the space and time complexities to O(n).
This is the case for inorder, preorder, and postorder, so I won't repeat this there.
| return max(self.height_helper(current.left), self.height_helper(current.right)) + 1 | ||
|
|
||
| def height(self): | ||
| return self.height_helper(self.root) |
There was a problem hiding this comment.
It doesn't seem you added a time or space complexity calculation for your implementation of height, but I am not going to move down to a Yellow, but I do encourage you to think through it.
No description provided.