Thanks to visit codestin.com
Credit goes to github.com

Skip to content

Jessica #3

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.

Sign up for GitHub

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

Jump to bottom
Open
wants to merge 3 commits into
base: master
Choose a base branch
from
Open

Jessica #3

wants to merge 3 commits into from

Conversation

@jessicacaley
Copy link

@jessicacaley jessicacaley commented Sep 19, 2019

Heaps Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question Answer
How is a Heap different from a Binary Search Tree? They are both binary trees, but are organized differently: a heap node's children are always smaller than a node, and a binary tree node's children have one smaller and one larger node as children.
Could you build a heap with linked nodes? Yes, but it would be much different efficiency because you can't access the nodes by index but also things like removing from the beginning are more efficient in a linked list.
Why is adding a node to a heap an O(log n) operation? Because you only have to hit each level of the tree once and the tree is guaranteed to be balanced so more nodes on the tree increase the complexity logarithmically instead of linearly.
Were the heap_up & heap_down methods useful? Why? Yes, very! It helped me understand the steps of what was happening and why for adding and removing nodes, and allowed for recursion to simpify the implementation.

CheezItMan
CheezItMan reviewed Oct 4, 2019
View reviewed changes
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.

Excellent work! You hit all the learning goals here. Well done!

lib/min_heap.rb
# This method adds a HeapNode instance to the heap
# Time Complexity: ?
# Space Complexity: ?
# Time Complexity: O(n(log(n))) where n is the number of nodes in the heap
Copy link

@CheezItMan CheezItMan Oct 4, 2019

Choose a reason for hiding this comment

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

Since you are making at most log n swaps to add something to a heap, the time complexity is O(log n)

lib/min_heap.rb
# This helper method takes an index and
# moves it up the heap if it's smaller
# than it's parent node.
def heap_down(index)
Copy link

@CheezItMan CheezItMan Oct 4, 2019

Choose a reason for hiding this comment

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

Nicely done!

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Reviewers

@CheezItMan CheezItMan CheezItMan left review comments

Assignees

No one assigned

Labels

None yet

Projects

None yet

Milestone

No milestone

Development

Successfully merging this pull request may close these issues.

2 participants

@jessicacaley @CheezItMan