Scissors - Araceli #56
Conversation
CheezItMan
left a comment
CheezItMan
left a comment
There was a problem hiding this comment.
Nice work Araceli. You hit the learning goals here. Well done.
| # Time Complexity: O(n) | ||
| # Space Complexity: O(1) | ||
| def add(self, key, value = None): |
| # Time Complexity: O(n) | ||
| # Space Complexity: O(1) | ||
| def find(self, key): |
There was a problem hiding this comment.
👍 Time complexity is O(n) if the tree is unbalanced and O(log n) if it is balanced.
| # Time Complexity: O(n) | ||
| # Space Complexity: O(1) | ||
| def inorder(self): |
There was a problem hiding this comment.
👍 However the space complexity is O(n) because you're building a list of all the nodes.
| # Time Complexity: O(n) | ||
| # Space Complexity: O(1) | ||
| def preorder(self): |
There was a problem hiding this comment.
👍 However the space complexity is O(n) because you're building a list of all the nodes.
| # Time Complexity: O(n) | ||
| # Space Complexity: O(1) | ||
| def postorder(self): |
There was a problem hiding this comment.
👍 However the space complexity is O(n) because you're building a list of all the nodes.
| # Time Complexity: O(n) | ||
| # Space Complexity: O(1) | ||
| def height(self): |
There was a problem hiding this comment.
👍 Because of the recursion the space complexity is O(h) where h is the height of the tree (which will be log n if the tree is balanced and it can approach n if the tree is very unbalanced).
2 participants
No description provided.