translate into english

Author: kfrancuz

C10-Elementary-Data-Structures/10.1.md

@@ -70,7 +70,7 @@ Using Figure 10.2 as a model, illustrate the result of each operation in the seq
 Rewrite ENQUEUE and DEQUEUE to detect underflow and overflow of a queue.
 
 ### `Answer`
-在开头加上
+Add at the beginning:
 
 	ENQUEUE(Q, x):
 		if head[Q] == tail[Q] + 1

C10-Elementary-Data-Structures/10.2.md

@@ -4,7 +4,7 @@ Can the dynamic-set operation INSERT be implemented on a singly linked list in O
 
 
 ### `Answer`
-插入的话可以直接插入在开头，删除的话需要遍历.
+INSERT - words can be insterted direclty at the beginning, DELETE - it requires to traverse whole list.
 
 
 ### Exercises 10.2-2
@@ -13,7 +13,7 @@ Implement a stack using a singly linked list L. The operations PUSH and POP shou
 take O(1) time.
 
 ### `Answer`
-PUSH插入到链表头，POP从链表头操作，都是O(1)的.
+PUSH - make element list's head，POP - remove list's had，both operations take O(1).
 
 ### Exercises 10.2-3
 ***
@@ -22,8 +22,10 @@ should still take O(1) time.
 
 ### `Answer`
 
-* ENQUEUE插入到链表尾
-* DEQUEUE从链表头取出
+Keep two pointers: one will point to beginning of the list, other to the end.
+
+* ENQUEUE - insert into end of the list,
+* DEQUEUE - remove list's head
 
 ### Exercises 10.2-4
 ***