Water - Christabel #1
Conversation
| // Time Complexity: O(log n) | ||
| // Space Complexity: O(log n) | ||
| add(key, value) { |
There was a problem hiding this comment.
👍 The space/time complexity is O(log n) if the tree is balanced and O(n) if it's not.
| // Time Complexity: O(log n) | ||
| // Space Complexity: O(log n) | ||
| find(key) { |
There was a problem hiding this comment.
👍 The space/time complexity is O(log n) if the tree is balanced and O(n) if it's not.
| // Time Complexity: O(n) | ||
| // Space Complexity: O(log n) | ||
| inorder() { |
There was a problem hiding this comment.
👍 Space and time complexities are O(n) - because of the array
| // Time Complexity: O(n) | ||
| // Space Complexity: O(log n) | ||
| preorder() { |
There was a problem hiding this comment.
👍 Space and time complexities are O(n) - because of the array
| // Time Complexity: O(n) | ||
| // Space Complexity: O(log n) | ||
| postorder() { |
There was a problem hiding this comment.
👍 Space and time complexities are O(n) - because of the array
| // Time Complexity: O(log n) | ||
| // Space Complexity: O(log n) | ||
| height() { |
There was a problem hiding this comment.
👍 The time complexity is O(n) since you are visiting each node and the space complexity is O(log n) if the tree is unbalanced and O(log n) if it is balanced.
No description provided.