Completed
💻 Introduction
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
An Introduction to Data Structures
Automatically move to the next video in the Classroom when playback concludes
- 1 💻 Introduction
- 2 ⌨️ Timestamps
- 3 ⌨️ Script and Visuals
- 4 ⌨️ References + Research
- 5 ⌨️ Questions
- 6 ⌨️ Shameless Plug
- 7 ⌨️ What are Data Structures?
- 8 ⌨️ Series Overview
- 9 💻 Measuring Efficiency with BigO Notation
- 10 ⌨️ Time Complexity Equations
- 11 ⌨️ The Meaning of BigO
- 12 ⌨️ Why BigO?
- 13 ⌨️ Quick Recap
- 14 ⌨️ Types of Time Complexity Equations
- 15 ⌨️ Final Note on Time Complexity Equations
- 16 💻 The Array
- 17 ⌨️ Array Basics
- 18 ⌨️ Array Names
- 19 ⌨️ Parallel Arrays
- 20 ⌨️ Array Types
- 21 ⌨️ Array Size
- 22 ⌨️ Creating Arrays
- 23 ⌨️ Populate-First Arrays
- 24 ⌨️ Populate-Later Arrays
- 25 ⌨️ Numerical Indexes
- 26 ⌨️ Replacing information in an Array
- 27 ⌨️ 2-Dimensional Arrays
- 28 ⌨️ Arrays as a Data Structure
- 29 ⌨️ Pros and Cons
- 30 💻 The ArrayList
- 31 ⌨️ Structure of the ArrayList
- 32 ⌨️ Initializing an ArrayList
- 33 ⌨️ ArrayList Functionality
- 34 ⌨️ ArrayList Methods
- 35 ⌨️ Add Method
- 36 ⌨️ Remove Method
- 37 ⌨️ Get Method
- 38 ⌨️ Set Method
- 39 ⌨️ Clear Method
- 40 ⌨️ toArray Method
- 41 ⌨️ ArrayList as a Data Structure
- 42 ⌨️ Comparing and Contrasting with Arrays
- 43 💻 The Stack
- 44 ⌨️ The Different types of Data Structures
- 45 ⌨️ Random Access Data Structures
- 46 ⌨️ Sequential Access Data Structures
- 47 ⌨️ Stack Basics
- 48 ⌨️ Common Stack Methods
- 49 ⌨️ Push Method
- 50 ⌨️ Pop Method
- 51 ⌨️ Peek Method
- 52 ⌨️ Contains Method
- 53 ⌨️ Time Complexity Equations
- 54 ⌨️ Uses for Stacks
- 55 💻 The Queue
- 56 ⌨️ Queue Basics
- 57 ⌨️ Common Queue Methods
- 58 ⌨️ Enqueue Method
- 59 ⌨️ Dequeue Method
- 60 ⌨️ Peek Method
- 61 ⌨️ Contains Method
- 62 ⌨️ Time Complexity Equations
- 63 ⌨️ Common Queue Uses
- 64 💻 The Linked List
- 65 ⌨️ LinkedList Visualization
- 66 ⌨️ Adding and Removing Information
- 67 ⌨️ Time Complexity Equations
- 68 ⌨️ Uses for LinkedLists
- 69 💻 The Doubly-LinkedList
- 70 ⌨️ Visualization
- 71 ⌨️ Adding and Removing Information
- 72 ⌨️ Time Complexity Equations
- 73 ⌨️ Uses of a Doubly-LinkedList
- 74 💻 The Dictionary
- 75 ⌨️ Dictionary Basics
- 76 ⌨️ Indexing Dictionaries
- 77 ⌨️ Dictionary Properties
- 78 💻 Hash Table Mini-Lesson
- 79 ⌨️ Time Complexity Equations
- 80 💻 Trees
- 81 ⌨️ Introduction to Hierarchical Data
- 82 ⌨️ Formal Background on the Tree
- 83 ⌨️ Tree Terminology and Visualization
- 84 ⌨️ Different types of Trees
- 85 ⌨️ Uses for the Tree
- 86 💻 Tries
- 87 ⌨️ Trie Basics
- 88 ⌨️ Trie Visualization
- 89 ⌨️ Flagging
- 90 ⌨️ Uses for Tries
- 91 💻 Heaps
- 92 ⌨️ Heap Basics
- 93 ⌨️ Min-Heaps
- 94 ⌨️ Max-Heaps
- 95 ⌨️ Building Heaps
- 96 ⌨️ Deleting from Heaps
- 97 ⌨️ Heap Implementations
- 98 💻 Graphs
- 99 ⌨️ Graph Basics
- 100 ⌨️ Directed vs. Undirected Graphs
- 101 ⌨️ Cyclic vs. Acyclic Graphs
- 102 ⌨️ Weighted Graphs
- 103 ⌨️ Types of Graphs
- 104 💻 Conclusion
- 105 💻 Shameless Plug