Раздел 1: Introduction
Лекция 1
Introduction to Data Structures
00:42
Лекция 2
How You Should View This Course
02:19
Раздел 2: Singly Linked List (Dummy Node Implementation)
Лекция 3
Intro to Singly LinkedList Data Structure
03:06
Лекция 4
Node Class, LinkedList Constructor and fields
04:41
Лекция 5
Implementing prepend method
06:08
Лекция 6
Implementing toString and getSize methods
04:50
Лекция 7
Implementing append method
04:38
Лекция 8
Implementing removeFirst method
05:44
Лекция 9
Implementing removeLast method
09:04
Лекция 10
Implementing insertAt method
11:04
Лекция 11
Implementing removeAt method
06:18
Лекция 12
Singly Linked List (Source Code)
Текст
Раздел 3: Doubly Linked List (Dummy Node Implementation)
Лекция 13
Intro to Doubly Linked List
02:09
Лекция 14
Setting up our Doubly Linked List
02:02
Лекция 15
Implementing prepend method
06:58
Лекция 16
Implementing append method
03:31
Лекция 17
Implementing removeFirst method
03:16
Лекция 18
Implementing removeLast method
04:01
Лекция 19
Implementing insertAt method
07:37
Лекция 20
Implementing removeAt method
05:32
Лекция 21
Implementing printReverse method
04:59
Лекция 22
Doubly Linked List (Source Code)
Текст
Раздел 4: Stacks (Abstract Data Type)
Лекция 23
Intro to Stacks (Abstract Data Structure)
04:11
Лекция 24
Creating our Stack Interface
01:51
Лекция 25
Creating our ArrayStack Class Implementing our resize method (Array Stack)
04:24
Лекция 26
Implementing push method and constructors (Array Stack)
07:15
Лекция 27
Implementing pop, peek, getSize, isEmpty methods (Array Stack)
05:57
Лекция 28
Implementing toString method (Array Stack)
03:52
Лекция 29
Implementing Stack with LinkedList Data Structure
08:30
Лекция 30
Stacks (Source Code)
Текст
Раздел 5: Queues (Abstract Data Type)
Лекция 31
Intro to Queues (Abstract Data Struture)
03:34
Лекция 32
Creating our Queue Interface
01:53
Лекция 33
Intro to Circular Arrays
03:36
Лекция 34
Creating our ArrayQueue Class (Queue Array)
03:46
Лекция 35
Implementing enqueue method (Queue Array)
06:56
Лекция 36
Implementing dequeue method (Queue Array)
05:32
Лекция 37
Implementing resize method The Problem (Queue Array)
03:23
Лекция 38
Implementing resize method The Solution (Queue Array)
06:17
Лекция 39
Implementing toString method (Queue Array)
03:43
Лекция 40
Implementing Queue with LinkedList Data Structure
07:41
Лекция 41
Implementing Queue with LinkedList Data Structure (Errata)
00:57
Лекция 42
Queues (Source Code)
Текст
Раздел 6: Priority Queues (Abstract Data Type)
Лекция 43
Introduction to Priority Queues
05:27
Лекция 44
Creating our Priority Queue Interface
02:54
Лекция 45
Setting up our Priority Queue (Priority Queue Array)
02:23
Лекция 46
Implementing our insert method (Priority Queue Array)
07:56
Лекция 47
Implementing our deleteMinKey method (Priority Queue Array)
09:14
Лекция 48
Implementing Priority Queue with LinkedList Data Structure
15:44
Раздел 7: Hash Tables
Лекция 49
Intro to Hash Tables
02:36
Лекция 50
Hash Methods and Collisions
05:24
Лекция 51
Creating our HashTable Class Implementing our Constructor and toString Method
05:05
Раздел 8: Bonus Section
Лекция 52
FREE UDEMY COURSE
Текст