Fix the deconstructor of linkedlist_queue.cpp

codes/cpp/chapter_stack_and_queue/linkedlist_deque.cpp

@@ -27,7 +27,7 @@ public:
 
     /* 析构方法 */
     ~LinkedListDeque() {
-        // 释放内存
+        // 遍历链表删除结点，释放内存
         DoublyListNode *pre, *cur = front;
         while (cur != nullptr) {
             pre = cur;

codes/cpp/chapter_stack_and_queue/linkedlist_queue.cpp

@@ -20,8 +20,8 @@ public:
     }
 
     ~LinkedListQueue() {
-        delete front;
-        delete rear;
+        // 遍历链表删除结点，释放内存
+        freeMemoryLinkedList(front);
     }
 
     /* 获取队列的长度 */

codes/cpp/chapter_stack_and_queue/linkedlist_stack.cpp

@@ -19,6 +19,7 @@ public:
     }
 
     ~LinkedListStack() {
+        // 遍历链表删除结点，释放内存
         freeMemoryLinkedList(stackTop);
     }