GH-277: Queue in general (#278)

Author: rain1024

README.md

@@ -80,10 +80,8 @@ A data structure is a data organization, management, and storage format that is
 <a href="/concepts/general/stack/README.md">Stack</a>
 </li>
 <li>
-<code>B</code> Queue
-<a href="/concepts/cpp/queue.md"><code>cpp🐀</code></a>
-<a href="/concepts/python/queue.md"><code>py🐍</code></a>
-<a href="/concepts/typescript/queue.md"><code>ts</code></a>
+<code>B</code> 
+<a href="/concepts/general/queue/README.md">Queue</a>
 </li>
 <li>
 <code>B</code> Set

concepts/cpp/queue.md renamed to concepts/cpp/queue/README.md

@@ -50,7 +50,7 @@ Output
 ## 🔗 Further Reading
 
 * [std::queue](https://en.cppreference.com/w/cpp/container/queue), cppreference.com
-* [Queue (abstract data type)](https://en.wikipedia.org/wiki/Queue_(abstract_data_type)), wikiepdia
+* [Queue (abstract data type)](https://en.wikipedia.org/wiki/Queue_(abstract_data_type)), wikipedia
 * ▶️ [Queue Introduction](https://www.youtube.com/watch?v=KxzhEQ-zpDc&list=PLDV1Zeh2NRsB6SWUrDFW2RmDotAfPbeHu&index=11&ab_channel=WilliamFiset), Data structures playlist, WilliamFiset, 2017
 * ▶️ [Queue Implementation](https://www.youtube.com/watch?v=EoisnPvUkOA&list=PLDV1Zeh2NRsB6SWUrDFW2RmDotAfPbeHu&index=12&ab_channel=WilliamFiset), Data structures playlist, WilliamFiset, 2017
 * ▶️ [Queue Code](https://www.youtube.com/watch?v=HV-hpvuGaC4&list=PLDV1Zeh2NRsB6SWUrDFW2RmDotAfPbeHu&index=13&ab_channel=WilliamFiset), Data structures playlist, WilliamFiset, 2017

concepts/general/queue/README.md

@@ -0,0 +1,26 @@
+# Queue
+
+*See implementation in*
+[C++](/concepts/cpp/queue/README.md),
+Java,
+[Python](/concepts/python/queue/README.md),
+[Typescript](/concepts/typescript/queue/README.md)
+
+In computer science, a queue is an abstract data type that serves as a collection of elements, with two main operations: `Enqueue`, which adds an element to the collection, and `Dequeue`, which removes the least recently added element that was not yet removed.
+
+## Stack Operations 
+
+Here are some basic operations that you can perform on stacks:
+
+* `Enqueue`: Add an element to the end of the queue.
+* `Dequeue`: Remove the first element of the queue.
+* `Peek`: Get the value of the first element of the queue without removing it.
+* `IsEmpty`: Check if the queue is empty.
+* `Size`: Get the number of elements in the queue.
+
+## 🔗 Further Reading
+
+* [Queue (abstract data type)](https://en.wikipedia.org/wiki/Queue_(abstract_data_type)), wikipedia
+* ▶️ [Queue Introduction](https://www.youtube.com/watch?v=KxzhEQ-zpDc&list=PLDV1Zeh2NRsB6SWUrDFW2RmDotAfPbeHu&index=11&ab_channel=WilliamFiset), Data structures playlist, WilliamFiset, 2017
+* ▶️ [Queue Implementation](https://www.youtube.com/watch?v=EoisnPvUkOA&list=PLDV1Zeh2NRsB6SWUrDFW2RmDotAfPbeHu&index=12&ab_channel=WilliamFiset), Data structures playlist, WilliamFiset, 2017
+* ▶️ [Queue Code](https://www.youtube.com/watch?v=HV-hpvuGaC4&list=PLDV1Zeh2NRsB6SWUrDFW2RmDotAfPbeHu&index=13&ab_channel=WilliamFiset), Data structures playlist, WilliamFiset, 2017

concepts/general/stack/README.md

@@ -22,5 +22,4 @@ Here are some basic operations that you can perform on stacks:
 
 * ▶️ [Stack Introduction](https://youtu.be/L3ud3rXpIxA?list=PLDV1Zeh2NRsB6SWUrDFW2RmDotAfPbeHu), Data structures playlist, WilliamFiset, 2017
 * ▶️ [Stack Implementation](https://www.youtube.com/watch?v=RAMqDLI6_1c&list=PLDV1Zeh2NRsB6SWUrDFW2RmDotAfPbeHu&index=9&ab_channel=WilliamFiset), Data structures playlist, WilliamFiset, 2017
-* ▶️ [Stack Code](https://www.youtube.com/watch?v=oiZssCfk4_U&list=PLDV1Zeh2NRsB6SWUrDFW2RmDotAfPbeHu&index=10&ab_channel=WilliamFiset), Data structures playlist, WilliamFiset, 2017
-es the most recently added element that was not yet removed.
+* ▶️ [Stack Code](https://www.youtube.com/watch?v=oiZssCfk4_U&list=PLDV1Zeh2NRsB6SWUrDFW2RmDotAfPbeHu&index=10&ab_channel=WilliamFiset), Data structures playlist, WilliamFiset, 2017

concepts/python/queue.md renamed to concepts/python/queue/README.md

@@ -31,11 +31,11 @@ A data structure is a data organization, management, and storage format that is
 </li>
 <li>
 <code>B</code> 
-<a href="/concepts/cpp/stack/README.md">Stack</
+<a href="/concepts/cpp/stack/README.md">Stack</a>
 </li>
 <li>
 <code>B</code> 
-<a href="/concepts/cpp/queue.md">Queue</a>
+<a href="/concepts/cpp/queue/README.md">Queue</a>
 </li>
 <li>
 <code>B</code> 

concepts/typescript/queue.md renamed to concepts/typescript/queue/README.md

@@ -36,7 +36,7 @@ A data structure is a data organization, management, and storage format that is
 </li>
 <li>
 <code>B</code>
-<a href="/concepts/python/queue.md">Queue</a>
+<a href="/concepts/python/queue/README.md">Queue</a>
 </li>
 <li>
 <code>B</code> 

readme/cpp/README.md

@@ -36,7 +36,7 @@ A data structure is a data organization, management, and storage format that is
 </li>
 <li>
 <code>B</code> 
-<a href="/concepts/typescript/queue.md">Queue</a>
+<a href="/concepts/typescript/queue/README.md">Queue</a>
 </li>
 <li>
 <code>B</code>