Skip to content

Conversation

@stephaniejmars
Copy link

Heaps Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question Answer
How is a Heap different from a Binary Search Tree? heaps only requirement is that children are less than parents, binary is in complete order
Could you build a heap with linked nodes? yes
Why is adding a node to a heap an O(log n) operation? because you add to the bottom then sort your way up one side
Were the heap_up & heap_down methods useful? Why? yes, because just inserting or removing something is only half the job, the heap needs to be left in a functional order with no gaps

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.

1 participant