\section{Data Structures}
\begin{center}
\begin{longtable}{|l|p{3cm}|l|l|l|}
\hline
\textbf{Name} & \textbf{Insertion} & \textbf{Deletion} & \textbf{Index} & \textbf{search} \\
\hline 

Array List & O(n) & O(n) & O(1) & O(n) \\

\hline

Singly Linked List & O(1) & O(n) & O(n) & O(n) \\

\hline

Hash Set/Map & O(1) & O(1) & n/a & O(1) \\

\hline 

Random BST & O(log(n)) & O(log(n)) & O(log(n)) & O(log(n)) \\

\hline 

Heap & O(log(n)) & O(log(n)) to remove max/min elem & n/a & n/a \\

\hline 

Trie & O(l) where l is the length of the word & O(l) & n/a &  O(l) \\

\hline

\end{longtable}
\end{center}
\section{Data Structures}
\begin{center}
\begin{longtable}{|l|p{3cm}|l|l|l|}
\hline
\textbf{Name} & \textbf{Insertion} & \textbf{Deletion} & \textbf{Index} & \textbf{search} \\
\hline 

Array List & O(n) & O(n) & O(1) & O(n) \\

\hline

Singly Linked List & O(1) & O(n) & O(n) & O(n) \\

\hline

Hash Set/Map & O(1) & O(1) & n/a & O(1) \\

\hline 

Random BST & O(log(n)) & O(log(n)) & O(log(n)) & O(log(n)) \\

\hline 

Heap & O(log(n)) & O(log(n)) to remove max/min elem & n/a & n/a \\

\hline 

Trie & O(k) where k is the length of the word & O(k) & n/a &  O(k) \\

\hline

\end{longtable}
\end{center}
Change O(l) to O(k) in trie because O(l) looks too much like O(1)
Change O(l) to O(k) in trie because O(l) looks too much like O(1)
