Stacks & Queues Stack implementation: Array based versus linked list based Implement circular buffer in array based implementation Implement auto resizing, build documentation and figure out how we can use similar interface Write mathematical analysis, articulate tradeoffs Prove implementation runs at O(1) time complexity Write tradeoff about space complexity contrast with sizing limitations Write JUnit tests to validate implementation. Prove edge cases are accounted for