Website Summary Files Commits Branches @commit @diff @stats
diff options
context:
space:
mode:
Commit6933e0190e32d68bd375b90496504ed2f626ff33 (patch)
Author
 Stoycho Kyosev <68247567+stoychoX@users.noreply.github.com>
2022-10-19 19:08:21 +0300
Committer
 GitHub <noreply@github.com>
2022-10-19 19:08:21 +0300
Files6180807b085c6cc87ae9c17d50c1dac9ca0a1725
Data-structures-and-algorithms-6933e0190e32d68bd375b90496504ed2f626ff33.tar
Data-structures-and-algorithms-6933e0190e32d68bd375b90496504ed2f626ff33.tar.gz
Data-structures-and-algorithms-6933e0190e32d68bd375b90496504ed2f626ff33.zip
Parent7b38c7fa2a76d912ca45576c06b9f900d77b616c (diff)
fix typo
1 files changed, 3 insertions, 3 deletions
-rw-r--r--Seminar03/Linked-Queue.hpp6
diff --git a/Seminar03/Linked-Queue.hpp b/Seminar03/Linked-Queue.hpp
index d11dc11..325f4c4 100644
--- a/Seminar03/Linked-Queue.hpp
+++ b/Seminar03/Linked-Queue.hpp
@@ -13,8 +13,8 @@ private:
LinkedNode(const T& argData, LinkedNode* argNext = nullptr) : data {argData}, next{argNext} {}
};
- LinkedNode* head; // Последния добавен елемент в опашката
- LinkedNode* tail; // Първия добавен елемент в опашката
+ LinkedNode* head; // Първия добавен елемент в опашката
+ LinkedNode* tail; // Последния добавен елемент в опашката
size_t queueSize;
void copy(const LinkedQueue<T>&);
@@ -159,4 +159,4 @@ LinkedQueue<T>::~LinkedQueue() {
free();
}
-#endif \ No newline at end of file
+#endif