Implement q_reverse function

Utilize `list_move` to move the `node` to the beginning of the `list`.

queue.c

@@ -174,7 +174,14 @@ void q_swap(struct list_head *head)
 }
 
 /* Reverse elements in queue */
-void q_reverse(struct list_head *head) {}
+void q_reverse(struct list_head *head)
+{
+    if (!head || list_empty(head))
+        return;
+    struct list_head *cur, *n;
+    list_for_each_safe (cur, n, head)
+        list_move(cur, head);
+}
 
 /* Reverse the nodes of the list k at a time */
 void q_reverseK(struct list_head *head, int k)