1. What are the advantages of implementing a stack as linked list as opposed to implementing a stack as a table?
2. Identify various tree diagrams as perfect, full, complete
3. Given a graphical representation of a binary tree:
   • give the height of the tree
   • give the height of a particular node
   • give the depth of a particular node
   • indicate the results of a preorder, postorder, inorder traversal
   • indicate the results of a level scan
   • give the worst case number of operations to access a node
   • give the average case number of operations to access a node
4. Given an infix expression
   • give the corresponding expression tree
   • give the prefix and postfix expressions
5. Given a general tree, give the corresponding binary tree representation of that tree