This course is taught by Instructor and Platform Support Engineer Erin Allard.
— Learning Topics —
00:00:00 – Python data structures primer
00:01:03 – What you should know
00:02:30 – Abstract data types
00:05:58 – Data structures
00:06:39 – Stacks as a linear abstract data type
00:09:46 – Creating the stack class and its methods
00:11:45 – push()
00:15:12 – pop()
00:19:09 – peek()
00:22:38 – size()
00:24:30 – is_empty()
00:26:43 – Challenge: Balanced symbols
00:27:54 – Balanced symbols solution approach
00:29:13 – Balanced symbols solution in code
00:32:49 – Queues as a linear abstract data type
00:36:18 – Creating the queue class and its methods
00:37:56 – enqueue()
00:41:04 – dequeue()
00:44:34 – peek()
00:48:18 – size() and is_empty()
00:51:20 – Challenge: Print queue
00:52:34 – Print queue solution approach
00:53:40 – Print queue solution in code
00:57:59 – Dequeues as a linear abstract data type
01:01:43 – Creating the deque class and its methods
01:03:57 – add_rear() and add_front()
01:08:18 – remove_rear() and remove_front()
01:12:34 – peek_rear() and peek_front()
01:16:24 – size() and is_empty()
01:19:25 – Challenge: Palindrome checker
01:20:03 – Palindrome checker solution approach
01:21:05 – Palindrome checker solution in code
01:23:31 – Next steps
