Introduction to Data Structures for Programming

• Data Structure and its Types
• Introduction to Algorithms
• Characteristics of Algorithms
• Algorithm Design Paradigms
• Relation between Data structures and Algorithms
• Importance and Applications
• Introduction to Algorithm Complexity
• Array Performance
• Creating an Array
• Moving Zeros
• Combining Two Lists
• Finding the Duplicates in a List
• Finding the Intersection of Two Lists
• Linked List Performance
• Create a Linked List
• Search a Linked List
• Removing a Node from a Linked List
• Finding a Linked List Cycle

4 LiveLab in this lesson — see the labs panel →

• When to Use Stacks
• Creating a Stack
• Using Stacks to Reverse Strings
• Min Stack
• Stacked Parentheses
• When to Use Queues
• Creating a Queue
• Python's Built-In Queue Class
• Create a Queue Using Two Stacks
• When to Use Hash Tables
• Characters in a String
• Two Sum
• When to Use Trees
• Creating a Binary Tree
• Breadth-First Tree Traversal
• More Tree Traversals
• Invert a Binary Tree
• When to Use Graphs
• Creating a Graph
• Dijkstra's Algorithm

8 LiveLab in this lesson — see the labs panel →

• When to Use Recursion
• Analyzing Algorithms
• Constant Time
• Logarithmic Time
• Linear Time
• Log-Linear Time
• Quadratic Time
• Cubic Time
• Exponential Time
• Best-Case vs. Worst-Case Complexity
• Space Complexity
• Why Is This Important?
• Amortized Analysis
• Linear Search
• When to Use a Linear Search
• Binary Search
• When to Use a Binary Search
• Bubble Sort
• When to Use Bubble Sort

6 LiveLab in this lesson — see the labs panel →

• Insertion Sort
• When to Use Insertion Sort
• Merge Sort
• When to Use Merge Sort
• Selection Sort
• Shell Sort
• Quick Sort
• Heap Sort
• Linear Sorting
• The ADT Queue
• The ADT Deque
• The ADT Priority Queue
• Tree Concepts
• Traversals of a Tree

10 LiveLab in this lesson — see the labs panel →

• Java Interfaces for Trees
• Examples of Binary Trees
• The Nodes in a Binary Tree
• An Implementation of the ADT Binary Tree
• An Implementation of an Expression Tree
• General Trees
• Using a Binary Tree to Represent a General Tree
• Reprise: The ADT Heap
• Using an Array to Represent a Heap
• Adding an Entry
• Removing the Root
• Creating a Heap
• Heap Sort
• AVL Trees
• Red-Black Trees
• Some Examples and Terminology
• Paths
• Splay Trees
• Tries: A Structured Approach to Efficient Information Retrieval

6 LiveLab in this lesson — see the labs panel →