-
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
binary search trees #34
base: master
Are you sure you want to change the base?
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.
Nice work Raquel, you hit the learning goals here. Well done. I left a few minor comments, but this is a strong submission.
if val == None: | ||
val = key | ||
|
||
self.key = key | ||
self.value = val | ||
self.left = None | ||
self.right = None | ||
|
||
|
||
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.
Interesting putting this on the TreeNode
class.
# Time Complexity: O(n) | ||
# Space Complexity:O(n) | ||
def preorder_helper(self, current, traversal_list): |
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) | ||
|
||
# Time Complexity: | ||
# Space Complexity: | ||
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 inorder_helper(self, current, traversal_list): |
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(log N) | ||
# Space Complexity: O(1) | ||
|
||
def add_helper(self, current_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.
The space complexity is O(log n) if the tree is balanced due to the recursive call stack.
# Time Complexity: O(n) | ||
# 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.
👍
WOOF! I am struggling with trees! Slowly making some sense but maybe I can ask you about post order, I strugged with figuring out where to put the append....