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

Rock - Priscille #51

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

Rock - Priscille #51

wants to merge 2 commits into from

Conversation

Priscillesg
Copy link

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 Priscille, you hit the learning goals here. Well done.

Comment on lines +11 to +12
def dict(self):
return {"key": self.key, "value": self.value}

Choose a reason for hiding this comment

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

👍 Useful!

Comment on lines +20 to 22
# Time Complexity: O(n)
# Space Complexity: O(1)
def add(self, key, value = None):

Choose a reason for hiding this comment

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

👍

Comment on lines +42 to 44
# Time Complexity: O(n)
# Space Complexity: O(1)
def find(self, key):

Choose a reason for hiding this comment

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

👍

Comment on lines +65 to 67
# Time Complexity: O(n)
# Space Complexity: O(1)
def inorder(self):

Choose a reason for hiding this comment

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

👍, however since you are building a list of all tree node values the space complexity is O(n)

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

Choose a reason for hiding this comment

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

👍, however since you are building a list of all tree node values the space complexity is O(n)

Comment on lines +95 to 97
# Time Complexity: O(n)
# Space Complexity: O(1)
def postorder(self):

Choose a reason for hiding this comment

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

👍, however since you are building a list of all tree node values the space complexity is O(n)

Comment on lines +109 to 111
# Time Complexity: O(n)
# Space Complexity: O(1)
def height(self):

Choose a reason for hiding this comment

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

👍 However the space complexity is O(h) where h is the height of the tree.

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