-
Notifications
You must be signed in to change notification settings - Fork 44
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
Earth - Beauttie #18
base: master
Are you sure you want to change the base?
Earth - Beauttie #18
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 Beauttie, you hit the learning goals and got BFS working. Interesting recursive solution.
# Time Complexity: O(log n) if balanced; O(n) if not | ||
# Space Complexity: O(log n) if balanced; O(n) if not | ||
def add(key, value = nil) |
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.
👍 Correct on time/space given the assumptions.
# Time Complexity: O(log n) if balanced; O(n) if not | ||
# Space Complexity: O(log n) if balanced; O(n) if not | ||
def find(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.
👍 Correct on time/space given the assumptions.
# Time Complexity: visit all nodes => O(n) | ||
# Space Complexity: array contains all nodes => O(n) | ||
def inorder |
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.
👍 Correct on time/space given the assumptions.
# Time Complexity: O(n) | ||
# Space Complexity: O(n) | ||
def preorder |
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.
👍 Correct on time/space given the assumptions.
# Time Complexity: O(n) | ||
# Space Complexity: O(n) | ||
def postorder |
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.
👍 Correct on time/space given the assumptions.
# Time Complexity: visit all nodes => O(n) | ||
# Space Complexity: O(log n) if balanced; O(n) if not | ||
def height |
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.
👍 Correct on time/space given the assumptions.
lib/tree.rb
Outdated
# Time Complexity: O(n^2) | ||
# Space Complexity: O(n) | ||
def bfs |
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.
👍 Actually I think this is O(n) for both space/time
No description provided.