##Data Structures

###Link List

1. addFront -> light operation. C : O(1)
2. addEnd -> light operation. C : O(1)
3. removeFront -> light operation. C : O(1)
4. removeEnd -> heavy operation since the whole list needs to be traversed to reach the last node. C : O(n)