-
Notifications
You must be signed in to change notification settings - Fork 64
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Rock - Delia #37
base: master
Are you sure you want to change the base?
Rock - Delia #37
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Well done Delia, you hit the learning goals here. Nice work!
# Time Complexity: O(log n) *if balanced | ||
# Space Complexity: O(1) | ||
def add(self, key, value = None): |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍 Good note about being balanced.
nice iterative solution
else: | ||
parent.right = TreeNode(key, value) | ||
|
||
def add_helper(self, curr_node, key, value): |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍
if self.root == None: | ||
self.root = TreeNode(key, value) | ||
else: | ||
# use helper method to add parameter | ||
self.add_helper(self.root, key, value) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Can be rewritten
if self.root == None: | |
self.root = TreeNode(key, value) | |
else: | |
# use helper method to add parameter | |
self.add_helper(self.root, key, value) | |
self.root = self.add_helper(self.root, key, value) |
# Time Complexity: O(log n) *if balanced | ||
# Space Complexity: O(1) | ||
def find(self, key): |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍
# Time Complexity: O(n) | ||
# Space Complexity: O(n) | ||
def inorder(self): |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍
# Time Complexity: O(n) | ||
# Space Complexity: O(n) | ||
def postorder(self): |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍
# Time Complexity: O(n) | ||
# Space Complexity: O(n) | ||
def height(self): |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍 The space complexity is O(h) where h is the height of the tree, but you're right if it's unbalanced h could be the number of nodes.
# # Time Complexity: O(n) | ||
# # Space Complexity: O(n) | ||
def bfs(self): |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍 Nice! You got the bonus.
No description provided.