\begin{figure}
\begin{alltt}
function Insert(point \(p\), cover set \(Q\sb{i}\), level \(i\)
   Q = 
 Set Q = {Children(q) : q ∈ Qi }.
 if d(p, Q) > 2i then return “no parent found”.
 else (a) Set Qi−1 = {q ∈ Q : d(p, q) ≤ 2i }.
      (b) if Insert(p, Qi−1 , i − 1) = “no parent found”
           and d(p, Qi ) ≤ 2i
                pick q ∈ Qi satisfying d(p, q) ≤ 2i
                insert p into Children(q)
                return “parent found”
      (c) else return “no parent found”
\end{alltt}
\caption{Pseudo code of Cover Trees\cite{CoverTrees}}\label{fig:pseudoCode-cover}
\end{figure}
