* A1 Tutorial this Fri 11-12pm BA1220 (read the handout!)
* TA office hours next week and the week after (check web announcements)

* We covered the linked list concept. 
* We went over the built-in java LinkedList:
        import java.util.LinkedList;  
       //implelments list interface; can be used for Queue/Stack
	private LinkedList<String> myLL;
        myLL = new LinkedList<String>();
        myLL.addLast()   //addFirst()
        myLL.removeFirst() //removeLast()
        myLL.isEmpty()
        myLL.get(index)  //getFirst() getlast()
        myLL.size();
        myLL.remove(element) 

* We looked at some of A2 code including  
         PureQueue.java interface + LLPureQueue.java implementation
         PureStack.java interface + LLPureStack.java implementation
         EditableQueue.java interface (using inheritance by extending the interface)


* We will have our own impelmentation of a linked list very soon

* Recursion: see fib, fact, and reverse programs, and also the slides
      Question: given a linked list of integers, provide a recursive
         implementation of  the following method:
             boolean member(int elmnt, LinkedList<Integer> l) 
         that checks if elmnt is in list l.

* memory model/tracing code? see the slides

* next week (finish memory model+recursion)+time analysis