Algorithms and Data Structures - Part 1
In this course, you will look at the core data structures and algorithms that are the building blocks of applications everywhere. You will learn how they work and see real-world examples that you can apply to your next project.
What you'll learn
Do you want to learn the core algorithms and data structures used in software development? This course is for you! In this course, Algorithms and Data Structures - Part 1, you will learn foundational knowledge of several common data structures and associated algorithms. First, you will learn about arrays and the asymptotic analysis of algorithms. Next, you will discover several data structures including linked lists, stacks, queues, binary search trees, and hash tables. Finally, you will explore how to modify a real-world application to use these data structures to improve usability and increase performance while reducing the amount of code. When you’re finished with this course, you will have the skills and knowledge of fundamental data structures and their algorithms needed to know when to use them in your own software development.
Table of contents
- Introduction 1m
- Introducing Linked Lists 1m
- Nodes and Node Chaining 1m
- Singly and Doubly Linked Lists 2m
- Code: Doubly Linked List 2m
- Adding Items to Linked Lists 4m
- Finding Items 1m
- Removing Items 2m
- Code: Removing Items 3m
- Linked List Enumeration 3m
- Sorted Lists 3m
- Demo: Updating the Contact Manager 7m
- Summary 1m
- Module Introduction 1m
- Trees 2m
- Binary Trees 4m
- Binary Tree Nodes 1m
- Binary Search Trees 5m
- Pre-order Traversal 5m
- In-order Traversal 3m
- Post-order Traversal 3m
- Searching the Tree 2m
- Removing Items: Leaf Nodes 1m
- Removing Items: Single Child 1m
- Removing Items: Two Children 3m
- Demo: Improving Performance with a Binary Tree 3m