[other heap] editorial work

datastruct/heap/other-heaps/kheap-en.tex

@@ -1925,7 +1925,7 @@ \subsection{Definition}
 % ================================================================
 \subsection{Basic heap operations}
 In this section, we first give the merging operation for pairing
-heap, which can be used to realize the insertion. Merging, insertion,
+heap, which can be used to realize insertion. Merging, insertion,
 and finding the minimum element are relative trivial compare to
 the extracting minimum element operation.
 
@@ -2236,7 +2236,7 @@ \subsubsection{Delete a node}
 \ee
 
 As delete algorithm uses pop, the performance is conjectured to be
-amortized $O(1)$ time.
+amortized $O(\lg n)$ time.
 
 \begin{Exercise}
 \begin{itemize}