notes

Personal notes
git clone git://git.laack.co/notes.git
Log | Files | Refs

Stack.md (440B)

      1 # Stack
      2 
      3 CS202 L14 / CS303 Ch 1
      4 
      5 **Definition:** This is a data structure that uses the lifo approach where you add to the top and remove from the top of the struct.
      6 
      7 push: add to stack
      8 
      9 peek: get top element. This can also be implemented by doing pop then pushing the result. 
     10 
     11 pop: remove from top
     12 
     13 This can be implemented as a [SinglyLinkedList](SinglyLinkedList.md)
     14 
     15 See [Queue](Queue.md) for information about the fifo implementation.