- /* First, zero out the rest of the entries. This is
- * necessary so that the entries appear as "unallocated"
- * in the next part. Each of these entries will
- * eventually be filled the representation of the root
- * node of a binary tree. */
+ /* First, zero out the remaining entries. This is
+ * necessary so that these entries appear as
+ * "unallocated" in the next part. Each of these entries
+ * will eventually be filled with the representation of
+ * the root node of a binary tree. */