Skip to content

Leaves - Bri #47

Open
brilatimer wants to merge 1 commit into
Ada-C12:masterfrom
brilatimer:master
Open

Leaves - Bri #47
brilatimer wants to merge 1 commit into
Ada-C12:masterfrom
brilatimer:master

Conversation

@brilatimer

Copy link
Copy Markdown

No description provided.

@CheezItMan CheezItMan left a comment

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Some good things here, take a look at my comments and let me know what questions you have.

Comment thread lib/tree.rb

# Time Complexity:
# Space Complexity:
def add_helper(node, key, value)

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment thread lib/tree.rb
Comment on lines +30 to 32
# Time Complexity: O(1)
# Space Complexity: O(1)
def add(key, value)

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Since add_helper has a time/space complexity of O(log n), this method does as well.

Comment thread lib/tree.rb
Comment on lines +36 to 38
# Time Complexity: O(n)
# Space Complexity: O(1)
def find(key)

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Remember that Binary search trees do binary search with a find, so it's O(log n) for time/space.

Comment thread lib/tree.rb
Comment on lines +54 to 56
# Time Complexity: O(n)
# Space Complexity: O(n)
def inorder

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment thread lib/tree.rb
Comment on lines +70 to 72
# Time Complexity: O(n)
# Space Complexity: O(n)
def preorder

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment thread lib/tree.rb
Comment on lines +87 to 89
# Time Complexity: O(n)
# Space Complexity: O(n)
def postorder

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment thread lib/tree.rb

# Time Complexity:
# Space Complexity:
def height

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍 But no guesses on time/space compexity?

Comment thread lib/tree.rb
# Time Complexity:
# Space Complexity:
# Space Complexity:
def bfs

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Looks like you almost have this.

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