\begin{minipage}[t]{8in}
\begin{tabular}{ll}
BinaryHeap$<$Key,Item$>$
 & bh;
\end{tabular}\\


 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Create a binary heap of size BINHEAPSIZE (defined in general.h), 
with an array-based implementation.
This is a fast priority queue if the number of elements is predetermined
and unions are infrequent.\end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
BinaryHeap$<$Key,Item$>$
 & binary\_heap\_name( (int) n);
\end{tabular}\\


 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Create a binary heap of size $n$.\end{minipage}
\end{minipage}
\vspace{0.2in}

