Corrected table structure in queue and stack .md files

Author: steam-bell-92

docs/python/Data_Structures/python-queue.md

@@ -11,7 +11,7 @@ Imagine a ticket line: the first person to join the line is the first person to
 Queues have two distinct ends where operations occur: the **Rear** (for insertion) and the **Front** (for removal).
 
 | Operation | Description | Analogy |
-| :--- | :--- | :--- | :--- |
+| :--- | :--- | :--- |
 | **Enqueue** | Adds an element to the **Rear**. | Joining the back of the line. |
 | **Dequeue** | Removes an element from the **Front**. | Leaving the front of the line. |
 | **Peek** | Returns the front element without removing it. | Looking at the person next in line. |

docs/python/Data_Structures/python-stack.md

@@ -15,7 +15,7 @@ A stack has three primary operations, all of which occur at the **Top** of the s
 3.  `Peek`: **Returns** the element at the top.
 
 | Operation | Description | Analogy |
-| :--- | :--- | :--- | :--- |
+| :--- | :--- | :--- |
 | **Push** | Add element to the **Top** | Placing a plate on top of the stack |
 | **Pop** | Remove element from the **Top** | Taking the top plate off the stack |
 | **Peek** | View the element at the **Top** | Looking at the top plate |