Apply suggestions from code review

Co-authored-by: Ernesto García <ernestognw@gmail.com>

.changeset/great-pianos-work.md

@@ -2,4 +2,4 @@
 'openzeppelin-solidity': minor
 ---
 
-`Heap`: A data structure that implements a heap based priority-queue.
+`Heap`: A data structure that implements a heap-based priority queue.

contracts/utils/README.adoc

@@ -23,7 +23,7 @@ Miscellaneous contracts and libraries containing utility functions you can use t
  * {DoubleEndedQueue}: An implementation of a https://en.wikipedia.org/wiki/Double-ended_queue[double ended queue] whose values can be removed added or remove from both sides. Useful for FIFO and LIFO structures.
  * {CircularBuffer}: A data structure to store the last N values pushed to it.
  * {Checkpoints}: A data structure to store values mapped to an strictly increasing key. Can be used for storing and accessing values over time.
- * {Heap}: A library that implement https://en.wikipedia.org/wiki/Binary_heap[binary heap] in storage.
+ * {Heap}: A library that implements a https://en.wikipedia.org/wiki/Binary_heap[binary heap] in storage.
  * {MerkleTree}: A library with https://wikipedia.org/wiki/Merkle_Tree[Merkle Tree] data structures and helper functions.
  * {Create2}: Wrapper around the https://blog.openzeppelin.com/getting-the-most-out-of-create2/[`CREATE2` EVM opcode] for safe use without having to deal with low-level assembly.
  * {Address}: Collection of functions for overloading Solidity's https://docs.soliditylang.org/en/latest/types.html#address[`address`] type.

scripts/generate/templates/Heap.js

@@ -19,20 +19,21 @@ const generate = ({ struct, node, valueType, indexType, blockSize }) => `\
  * - An array of values (payload). At each index we store a ${valueType} \`value\` and \`lookup\`, the index of the node
  *   that points to this value.
  *
- * Some invariant:
+ * Some invariants:
  *   \`\`\`
  *   i == heap.data[heap[data].index].lookup // for all index i
  *   i == heap.data[heap[data].lookup].index // for all index i
  *   \`\`\`
  *
- * The structure is order so that each node is bigger then its parent. An immediate consequence is that the
+ * The structure is ordered so that each node is bigger than its parent. An immediate consequence is that the
  * smallest value is the one at the root. It can be retrieved in O(1) at \`heap.data[heap.data[0].index].value\`
  *
- * This structure is designed for the following complexities:
- * - peek (get the smallest value in set): O(1)
- * - insert (insert a value in the set): 0(log(n))
- * - pop (remove the smallest value in set): O(log(n))
- * - replace (replace the smallest value in set with a new value): O(log(n))
+ * The structure is designed to perform the following operations with the corresponding complexities:
+ *
+ * * peek (get the smallest value in set): O(1)
+ * * insert (insert a value in the set): 0(log(n))
+ * * pop (remove the smallest value in set): O(log(n))
+ * * replace (replace the smallest value in set with a new value): O(log(n))
  */
 struct ${struct} {
     ${node}[] data;