Skip to content
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

Open
wants to merge 6 commits into
base: master
Choose a base branch
from
Open

Earth - Beauttie #18

wants to merge 6 commits into from

Conversation

beauttie
Copy link

@beauttie beauttie commented Apr 2, 2021

No description provided.

Copy link

@CheezItMan CheezItMan left a 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.

Comment on lines +19 to +21
# 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)

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.

Comment on lines +48 to 50
# 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)

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.

Comment on lines +66 to 68
# Time Complexity: visit all nodes => O(n)
# Space Complexity: array contains all nodes => O(n)
def inorder

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.

Comment on lines +80 to 82
# Time Complexity: O(n)
# Space Complexity: O(n)
def preorder

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.

Comment on lines +94 to 96
# Time Complexity: O(n)
# Space Complexity: O(n)
def postorder

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.

Comment on lines +108 to 110
# Time Complexity: visit all nodes => O(n)
# Space Complexity: O(log n) if balanced; O(n) if not
def height

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
Comment on lines 121 to 123
# Time Complexity: O(n^2)
# Space Complexity: O(n)
def bfs

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

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants