Merge pull request #29 from gerasimov/patch-1

fix typo

book/content/part02/queue.asc

@@ -77,7 +77,7 @@ As an experiment, we can see in the following table that if we had implemented t
 .2+.^s| Data Structure 2+^s| Searching By 3+^s| Inserting at the 3+^s| Deleting from .2+.^s| Space
 ^|_Index/Key_ ^|_Value_ ^|_beginning_ ^|_middle_ ^|_end_ ^|_beginning_ ^|_middle_ ^|_end_
 | Queue (w/array) ^|- ^|- ^|- ^|- ^|O(1) ^|*O(n)* ^|- ^|- ^|O(n)
-| Queue (w/list) ^|- ^|- ^|- ^|- ^|O(1) ^|- ^|- ^|O(1) ^|O(n)
+| Queue (w/list) ^|- ^|- ^|- ^|- ^|O(1) ^|O(1) ^|- ^|- ^|O(n)
 |===
 // end::table[]
 indexterm:[Runtime, Linear]