fixing line breaks

lectures/11_list_implementation/README.md

@@ -40,7 +40,7 @@ Node<T>* prev_;
 };
 ```
 
-- Note that we now assume that we have both a head pointer, as before and a tail pointer variable, which stores the address of the last node in the linked list.
+- Note that we now assume that we have both a head pointer as before, and a tail pointer variable, which stores the address of the last node in the linked list.
 - The tail pointer is not strictly necessary, but it allows immediate access to the end of the list for efficient
 push-back operations.