\documentclass[12pt]{article} \usepackage{geometry} \geometry{verbose,letterpaper,tmargin=0.75in,bmargin=0.75in,lmargin=0.75in,rmargin=0.75in,headheight=0.75in,headsep=0.75in,footskip=0.2in} \pagestyle{empty} \newcommand*{\quizdate}{March 5th, 2008} \newcommand*{\subjectname}{CIS 26} \begin{document} \noindent Name: \hrulefill \hspace*{1em} SS\# (4 digits): \hrulefill \hspace*{1em} PaperId\#: 60 \noindent \subjectname{} Quiz \hfill \quizdate \medskip \begin{center} \dotfill\\ Tear at this line. \end{center} \medskip \noindent PaperId\#: 60 \hfill \subjectname{} Quiz \hfill \quizdate \hfill PaperId\#: 60 \begin{enumerate} \item Define a 2 child binary search tree node. \vspace*{10ex} \item How is binary search tree node different from doubly linked list node? \vspace*{10ex} \item Write code to add an integer into a binary search tree. \vspace*{10ex} \item Write code to `reverse' a binary search tree. This just involves flipping left/right for each node in the tree. \vspace*{10ex} \item Given a binary tree, write a function to find the max tree depth. Assume that root node has depth 0. \vspace*{10ex} \end{enumerate} \vfill \noindent PaperId\#: 60 \hfill \subjectname{} Quiz \hfill \quizdate \hfill PaperId\#: 60 \pagebreak \noindent Name: \hrulefill \hspace*{1em} SS\# (4 digits): \hrulefill \hspace*{1em} PaperId\#: 80 \noindent \subjectname{} Quiz \hfill \quizdate \medskip \begin{center} \dotfill\\ Tear at this line. \end{center} \medskip \noindent PaperId\#: 80 \hfill \subjectname{} Quiz \hfill \quizdate \hfill PaperId\#: 80 \begin{enumerate} \item Define a 2 child binary search tree node. \vspace*{10ex} \item How is binary search tree node different from doubly linked list node? \vspace*{10ex} \item Write code to add an integer into a binary search tree. \vspace*{10ex} \item Write code to `reverse' a binary search tree. This just involves flipping left/right for each node in the tree. \vspace*{10ex} \item Given a binary tree, write a function to find the max tree depth. Assume that root node has depth 0. \vspace*{10ex} \end{enumerate} \vfill \noindent PaperId\#: 80 \hfill \subjectname{} Quiz \hfill \quizdate \hfill PaperId\#: 80 \pagebreak \noindent Name: \hrulefill \hspace*{1em} SS\# (4 digits): \hrulefill \hspace*{1em} PaperId\#: 31 \noindent \subjectname{} Quiz \hfill \quizdate \medskip \begin{center} \dotfill\\ Tear at this line. \end{center} \medskip \noindent PaperId\#: 31 \hfill \subjectname{} Quiz \hfill \quizdate \hfill PaperId\#: 31 \begin{enumerate} \item Define a 2 child binary search tree node. \vspace*{10ex} \item How is binary search tree node different from doubly linked list node? \vspace*{10ex} \item Write code to add an integer into a binary search tree. \vspace*{10ex} \item Write code to `reverse' a binary search tree. This just involves flipping left/right for each node in the tree. \vspace*{10ex} \item Given a binary tree, write a function to find the max tree depth. Assume that root node has depth 0. \vspace*{10ex} \end{enumerate} \vfill \noindent PaperId\#: 31 \hfill \subjectname{} Quiz \hfill \quizdate \hfill PaperId\#: 31 \pagebreak \noindent Name: \hrulefill \hspace*{1em} SS\# (4 digits): \hrulefill \hspace*{1em} PaperId\#: 61 \noindent \subjectname{} Quiz \hfill \quizdate \medskip \begin{center} \dotfill\\ Tear at this line. \end{center} \medskip \noindent PaperId\#: 61 \hfill \subjectname{} Quiz \hfill \quizdate \hfill PaperId\#: 61 \begin{enumerate} \item Define a 2 child binary search tree node. \vspace*{10ex} \item How is binary search tree node different from doubly linked list node? \vspace*{10ex} \item Write code to add an integer into a binary search tree. \vspace*{10ex} \item Write code to `reverse' a binary search tree. This just involves flipping left/right for each node in the tree. \vspace*{10ex} \item Given a binary tree, write a function to find the max tree depth. Assume that root node has depth 0. \vspace*{10ex} \end{enumerate} \vfill \noindent PaperId\#: 61 \hfill \subjectname{} Quiz \hfill \quizdate \hfill PaperId\#: 61 \pagebreak \noindent Name: \hrulefill \hspace*{1em} SS\# (4 digits): \hrulefill \hspace*{1em} PaperId\#: 88 \noindent \subjectname{} Quiz \hfill \quizdate \medskip \begin{center} \dotfill\\ Tear at this line. \end{center} \medskip \noindent PaperId\#: 88 \hfill \subjectname{} Quiz \hfill \quizdate \hfill PaperId\#: 88 \begin{enumerate} \item Define a 2 child binary search tree node. \vspace*{10ex} \item How is binary search tree node different from doubly linked list node? \vspace*{10ex} \item Write code to add an integer into a binary search tree. \vspace*{10ex} \item Write code to `reverse' a binary search tree. This just involves flipping left/right for each node in the tree. \vspace*{10ex} \item Given a binary tree, write a function to find the max tree depth. Assume that root node has depth 0. \vspace*{10ex} \end{enumerate} \vfill \noindent PaperId\#: 88 \hfill \subjectname{} Quiz \hfill \quizdate \hfill PaperId\#: 88 \pagebreak \noindent Name: \hrulefill \hspace*{1em} SS\# (4 digits): \hrulefill \hspace*{1em} PaperId\#: 64 \noindent \subjectname{} Quiz \hfill \quizdate \medskip \begin{center} \dotfill\\ Tear at this line. \end{center} \medskip \noindent PaperId\#: 64 \hfill \subjectname{} Quiz \hfill \quizdate \hfill PaperId\#: 64 \begin{enumerate} \item Define a 2 child binary search tree node. \vspace*{10ex} \item How is binary search tree node different from doubly linked list node? \vspace*{10ex} \item Write code to add an integer into a binary search tree. \vspace*{10ex} \item Write code to `reverse' a binary search tree. This just involves flipping left/right for each node in the tree. \vspace*{10ex} \item Given a binary tree, write a function to find the max tree depth. Assume that root node has depth 0. \vspace*{10ex} \end{enumerate} \vfill \noindent PaperId\#: 64 \hfill \subjectname{} Quiz \hfill \quizdate \hfill PaperId\#: 64 \pagebreak \noindent Name: \hrulefill \hspace*{1em} SS\# (4 digits): \hrulefill \hspace*{1em} PaperId\#: 10 \noindent \subjectname{} Quiz \hfill \quizdate \medskip \begin{center} \dotfill\\ Tear at this line. \end{center} \medskip \noindent PaperId\#: 10 \hfill \subjectname{} Quiz \hfill \quizdate \hfill PaperId\#: 10 \begin{enumerate} \item Define a 2 child binary search tree node. \vspace*{10ex} \item How is binary search tree node different from doubly linked list node? \vspace*{10ex} \item Write code to add an integer into a binary search tree. \vspace*{10ex} \item Write code to `reverse' a binary search tree. This just involves flipping left/right for each node in the tree. \vspace*{10ex} \item Given a binary tree, write a function to find the max tree depth. Assume that root node has depth 0. \vspace*{10ex} \end{enumerate} \vfill \noindent PaperId\#: 10 \hfill \subjectname{} Quiz \hfill \quizdate \hfill PaperId\#: 10 \pagebreak \noindent Name: \hrulefill \hspace*{1em} SS\# (4 digits): \hrulefill \hspace*{1em} PaperId\#: 20 \noindent \subjectname{} Quiz \hfill \quizdate \medskip \begin{center} \dotfill\\ Tear at this line. \end{center} \medskip \noindent PaperId\#: 20 \hfill \subjectname{} Quiz \hfill \quizdate \hfill PaperId\#: 20 \begin{enumerate} \item Define a 2 child binary search tree node. \vspace*{10ex} \item How is binary search tree node different from doubly linked list node? \vspace*{10ex} \item Write code to add an integer into a binary search tree. \vspace*{10ex} \item Write code to `reverse' a binary search tree. This just involves flipping left/right for each node in the tree. \vspace*{10ex} \item Given a binary tree, write a function to find the max tree depth. Assume that root node has depth 0. \vspace*{10ex} \end{enumerate} \vfill \noindent PaperId\#: 20 \hfill \subjectname{} Quiz \hfill \quizdate \hfill PaperId\#: 20 \pagebreak \noindent Name: \hrulefill \hspace*{1em} SS\# (4 digits): \hrulefill \hspace*{1em} PaperId\#: 12 \noindent \subjectname{} Quiz \hfill \quizdate \medskip \begin{center} \dotfill\\ Tear at this line. \end{center} \medskip \noindent PaperId\#: 12 \hfill \subjectname{} Quiz \hfill \quizdate \hfill PaperId\#: 12 \begin{enumerate} \item Define a 2 child binary search tree node. \vspace*{10ex} \item How is binary search tree node different from doubly linked list node? \vspace*{10ex} \item Write code to add an integer into a binary search tree. \vspace*{10ex} \item Write code to `reverse' a binary search tree. This just involves flipping left/right for each node in the tree. \vspace*{10ex} \item Given a binary tree, write a function to find the max tree depth. Assume that root node has depth 0. \vspace*{10ex} \end{enumerate} \vfill \noindent PaperId\#: 12 \hfill \subjectname{} Quiz \hfill \quizdate \hfill PaperId\#: 12 \pagebreak \noindent Name: \hrulefill \hspace*{1em} SS\# (4 digits): \hrulefill \hspace*{1em} PaperId\#: 24 \noindent \subjectname{} Quiz \hfill \quizdate \medskip \begin{center} \dotfill\\ Tear at this line. \end{center} \medskip \noindent PaperId\#: 24 \hfill \subjectname{} Quiz \hfill \quizdate \hfill PaperId\#: 24 \begin{enumerate} \item Define a 2 child binary search tree node. \vspace*{10ex} \item How is binary search tree node different from doubly linked list node? \vspace*{10ex} \item Write code to add an integer into a binary search tree. \vspace*{10ex} \item Write code to `reverse' a binary search tree. This just involves flipping left/right for each node in the tree. \vspace*{10ex} \item Given a binary tree, write a function to find the max tree depth. Assume that root node has depth 0. \vspace*{10ex} \end{enumerate} \vfill \noindent PaperId\#: 24 \hfill \subjectname{} Quiz \hfill \quizdate \hfill PaperId\#: 24 \pagebreak \noindent Name: \hrulefill \hspace*{1em} SS\# (4 digits): \hrulefill \hspace*{1em} PaperId\#: 26 \noindent \subjectname{} Quiz \hfill \quizdate \medskip \begin{center} \dotfill\\ Tear at this line. \end{center} \medskip \noindent PaperId\#: 26 \hfill \subjectname{} Quiz \hfill \quizdate \hfill PaperId\#: 26 \begin{enumerate} \item Define a 2 child binary search tree node. \vspace*{10ex} \item How is binary search tree node different from doubly linked list node? \vspace*{10ex} \item Write code to add an integer into a binary search tree. \vspace*{10ex} \item Write code to `reverse' a binary search tree. This just involves flipping left/right for each node in the tree. \vspace*{10ex} \item Given a binary tree, write a function to find the max tree depth. Assume that root node has depth 0. \vspace*{10ex} \end{enumerate} \vfill \noindent PaperId\#: 26 \hfill \subjectname{} Quiz \hfill \quizdate \hfill PaperId\#: 26 \pagebreak \noindent Name: \hrulefill \hspace*{1em} SS\# (4 digits): \hrulefill \hspace*{1em} PaperId\#: 38 \noindent \subjectname{} Quiz \hfill \quizdate \medskip \begin{center} \dotfill\\ Tear at this line. \end{center} \medskip \noindent PaperId\#: 38 \hfill \subjectname{} Quiz \hfill \quizdate \hfill PaperId\#: 38 \begin{enumerate} \item Define a 2 child binary search tree node. \vspace*{10ex} \item How is binary search tree node different from doubly linked list node? \vspace*{10ex} \item Write code to add an integer into a binary search tree. \vspace*{10ex} \item Write code to `reverse' a binary search tree. This just involves flipping left/right for each node in the tree. \vspace*{10ex} \item Given a binary tree, write a function to find the max tree depth. Assume that root node has depth 0. \vspace*{10ex} \end{enumerate} \vfill \noindent PaperId\#: 38 \hfill \subjectname{} Quiz \hfill \quizdate \hfill PaperId\#: 38 \pagebreak \noindent Name: \hrulefill \hspace*{1em} SS\# (4 digits): \hrulefill \hspace*{1em} PaperId\#: 51 \noindent \subjectname{} Quiz \hfill \quizdate \medskip \begin{center} \dotfill\\ Tear at this line. \end{center} \medskip \noindent PaperId\#: 51 \hfill \subjectname{} Quiz \hfill \quizdate \hfill PaperId\#: 51 \begin{enumerate} \item Define a 2 child binary search tree node. \vspace*{10ex} \item How is binary search tree node different from doubly linked list node? \vspace*{10ex} \item Write code to add an integer into a binary search tree. \vspace*{10ex} \item Write code to `reverse' a binary search tree. This just involves flipping left/right for each node in the tree. \vspace*{10ex} \item Given a binary tree, write a function to find the max tree depth. Assume that root node has depth 0. \vspace*{10ex} \end{enumerate} \vfill \noindent PaperId\#: 51 \hfill \subjectname{} Quiz \hfill \quizdate \hfill PaperId\#: 51 \pagebreak \noindent Name: \hrulefill \hspace*{1em} SS\# (4 digits): \hrulefill \hspace*{1em} PaperId\#: 81 \noindent \subjectname{} Quiz \hfill \quizdate \medskip \begin{center} \dotfill\\ Tear at this line. \end{center} \medskip \noindent PaperId\#: 81 \hfill \subjectname{} Quiz \hfill \quizdate \hfill PaperId\#: 81 \begin{enumerate} \item Define a 2 child binary search tree node. \vspace*{10ex} \item How is binary search tree node different from doubly linked list node? \vspace*{10ex} \item Write code to add an integer into a binary search tree. \vspace*{10ex} \item Write code to `reverse' a binary search tree. This just involves flipping left/right for each node in the tree. \vspace*{10ex} \item Given a binary tree, write a function to find the max tree depth. Assume that root node has depth 0. \vspace*{10ex} \end{enumerate} \vfill \noindent PaperId\#: 81 \hfill \subjectname{} Quiz \hfill \quizdate \hfill PaperId\#: 81 \pagebreak \noindent Name: \hrulefill \hspace*{1em} SS\# (4 digits): \hrulefill \hspace*{1em} PaperId\#: 43 \noindent \subjectname{} Quiz \hfill \quizdate \medskip \begin{center} \dotfill\\ Tear at this line. \end{center} \medskip \noindent PaperId\#: 43 \hfill \subjectname{} Quiz \hfill \quizdate \hfill PaperId\#: 43 \begin{enumerate} \item Define a 2 child binary search tree node. \vspace*{10ex} \item How is binary search tree node different from doubly linked list node? \vspace*{10ex} \item Write code to add an integer into a binary search tree. \vspace*{10ex} \item Write code to `reverse' a binary search tree. This just involves flipping left/right for each node in the tree. \vspace*{10ex} \item Given a binary tree, write a function to find the max tree depth. Assume that root node has depth 0. \vspace*{10ex} \end{enumerate} \vfill \noindent PaperId\#: 43 \hfill \subjectname{} Quiz \hfill \quizdate \hfill PaperId\#: 43 \pagebreak \noindent Name: \hrulefill \hspace*{1em} SS\# (4 digits): \hrulefill \hspace*{1em} PaperId\#: 27 \noindent \subjectname{} Quiz \hfill \quizdate \medskip \begin{center} \dotfill\\ Tear at this line. \end{center} \medskip \noindent PaperId\#: 27 \hfill \subjectname{} Quiz \hfill \quizdate \hfill PaperId\#: 27 \begin{enumerate} \item Define a 2 child binary search tree node. \vspace*{10ex} \item How is binary search tree node different from doubly linked list node? \vspace*{10ex} \item Write code to add an integer into a binary search tree. \vspace*{10ex} \item Write code to `reverse' a binary search tree. This just involves flipping left/right for each node in the tree. \vspace*{10ex} \item Given a binary tree, write a function to find the max tree depth. Assume that root node has depth 0. \vspace*{10ex} \end{enumerate} \vfill \noindent PaperId\#: 27 \hfill \subjectname{} Quiz \hfill \quizdate \hfill PaperId\#: 27 \pagebreak \end{document}