Notebook Templates

These notebooks are supposed to be used as a preparation for class. They contain skeleton APIs for the data structures and algorithms we will develop during class.

• Language Intro - Part 1
• Language Intro - Part 2
• Language Intro - Part 3
• Runtime Analysis and Computational Complexity
• Searching, Sorting, and Timing
• Array Lists
• Iterators
• Linked Structures
• Linked Lists
• Stacks and Queues
• Hashtables
• Recursion
• Binary Search Trees
• The Binary Search Tree Data Structure
• Balanced BS Trees: AVL Trees
• Priority Queues
• Sorting Algorithms
• Search Algorithms