1. Intro to Analysis Tools

2. Asymptotic Analysis

3. Big O notation

4. Relatives of Big O

5. Determining Complexities

6. Q1

7 .Q2

8. Arrays

9. Array Lists

10. Introduction to Linked Lists

11. Singly Linked Lists

12. Doubly Linked Lists

13. Q1

14. Stacks

15. Queues

16. Introduction

17. Tree Traversal

18. Binary Trees and some properties

19. Binary Search Trees

20. Insertion into BST (with code)

21. Deletions in BST

22. BST Complexities

23. Q1

24. Introduction to AVL trees

25. Insertion and Deletions in AVL trees

26. Rotations in AVL trees

27. Q

28. Introduction to Hashtables

29. Hashfunctions I

30. Hashfunctions II

31. Chaining

32. Open Addressing

33. Table Size and Complexities

34. Q1

35. Q2