Added stack and queue methods implementations

Author: majid shahbaz

src/datastructures/lists/README.md

@@ -110,7 +110,7 @@ print(_stack)
 
 #### FIFO or LILO (First out First out || Last in Last out)
 
-t is also possible to use a list as a queue, where the first element added is the first element retrieved (“first-in, first-out”); however, lists are not efficient for this purpose. While appends and pops from the end of list are fast, doing inserts or pops from the beginning of a list is slow (because all of the other elements have to be shifted by one).
+It is also possible to use a list as a queue, where the first element added is the first element retrieved (“first-in, first-out”); however, lists are not efficient for this purpose. While appends and pops from the end of list are fast, doing inserts or pops from the beginning of a list is slow (because all of the other elements have to be shifted by one).
 To implement a queue, use collections.deque which was designed to have fast appends and pops from both ends.
 
 Example: