We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent dcce1b0 commit 505af8bCopy full SHA for 505af8b
.github/PULL_REQUEST_TEMPLATE
@@ -8,5 +8,7 @@ Question | Answer
8
:------------- | :-------------
9
How is a Heap different from a Binary Search Tree? |
10
Could you build a heap with linked nodes? |
11
-Why is adding a node to a heap an O(log n) operation?
+Why is adding a node to a heap an O(log n) operation? |
12
+Were the `heap_up` & `heap_down` methods useful? Why? |
13
+
14
0 commit comments