diff --git a/queue.h b/queue.h
index bcd1088ee..2d9466d80 100644
--- a/queue.h
+++ b/queue.h
@@ -134,7 +134,7 @@ int q_size(struct list_head *head);
  *
  * The middle node of a linked list of size n is the
  * ⌊n / 2⌋th node from the start using 0-based indexing.
- * If there're six elements, the third member should be returned.
+ * If there're six elements, the third member should be deleted.
  *
  * Reference:
  * https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list/
diff --git a/scripts/checksums b/scripts/checksums
index 31710faa7..87ff044d7 100644
--- a/scripts/checksums
+++ b/scripts/checksums
@@ -1,3 +1,3 @@
-45da6585400a15237f09d896bbb807f85f449e92  queue.h
+398b59c23f699ff1bf1e73a94503a9a91caa9207  queue.h
 9be9666430f392924f5d27caa71a412527bf9267  list.h
 3bb0192cee08d165fd597a9f6fbb404533e28fcf  scripts/check-commitlog.sh