Update index.md

Author: marcosscarpim

content/data-structures/linear/qeue/index.md

@@ -6,7 +6,7 @@ grand_parent: Data Structures
 nav_order: 4
 ---
 <script src="https://unpkg.com/kotlin-playground@1" data-selector="code"></script>
-# Qeue
+# Queue
 > A Queue is defined as a linear data structure that is open at both ends and the operations are performed in First In First Out (FIFO) order.
 
 We define a queue to be a list in which all additions to the list are made at one end, and all deletions from the list are made at the other end.  The element which is first pushed into the order, the operation is first performed on that.
@@ -138,4 +138,4 @@ fun main() {
 
 #### REFERENCES:
 [https://www.geeksforgeeks.org/queue-data-structure/](https://www.geeksforgeeks.org/queue-data-structure/) 
-[https://www.prepbytes.com/blog/queues/applications-of-queue-data-structure/#:~:text=When%20any%20resource%20is%20shared,queue%2C%20doubly%20ended%20priority%20queue.](https://www.prepbytes.com/blog/queues/applications-of-queue-data-structure/#:~:text=When%20any%20resource%20is%20shared,queue%2C%20doubly%20ended%20priority%20queue.)
+[https://www.prepbytes.com/blog/queues/applications-of-queue-data-structure/#:~:text=When%20any%20resource%20is%20shared,queue%2C%20doubly%20ended%20priority%20queue.](https://www.prepbytes.com/blog/queues/applications-of-queue-data-structure/#:~:text=When%20any%20resource%20is%20shared,queue%2C%20doubly%20ended%20priority%20queue.)