C++: Linear Data Structures and Trees
Keep adding new skills with 10,000+ programs for $239 (usually $399). Save now.
C++: Linear Data Structures and Trees
This course is part of C++: Data Structures and Algorithms Specialization
Instructor: Patrick Ester
Included with
Learn more
Recommended experience
Recommended experience
What you'll learn
Learners will learn about linear data structures. Topics start with the different varieties of linked lists and moves on to stacks and queues.
Trees are introduced as the first non-linear data structure. Topics include binary trees, tree traversal, searching a tree, and self-balancing trees.
Skills you'll gain
Tools you'll learn
Details to know
See how employees at top companies are mastering in-demand skills
Build your subject-matter expertise
- Learn new concepts from industry experts
- Gain a foundational understanding of a subject or tool
- Develop job-relevant skills with hands-on projects
- Earn a shareable career certificate
There are 4 modules in this course
Code and run your first C++ program about data structures and algorithms in minutes without installing anything!
This course is designed for learners familiar with C++ basics and object-oriented programming. It provides a solid foundation of not just C++, but core data structures and algorithms topics that can be transferred to other languages. The modules in this course cover linear data structures like lists (singly linked, doubly linked, circular), stacks, queues, and introduces the first non-linear data structure trees. To allow for a truly hands-on, self-paced learning experience, this course is video-free. Assignments contain short explanations with images and runnable code examples with suggested edits to explore code examples further, building a deeper understanding by doing. You'll benefit from instant feedback from a variety of assessment items along the way, gently progressing from quick understanding checks (multiple choice, fill in the blank, and un-scrambling code blocks) to small, approachable coding exercises that take minutes instead of hours.
Welcome to Week 1 of the Linear Data Structures and Trees course. You will learn about abstract data types (ADT), the list ADT, the many variations of the list (singly, doubly, circular linked lists), as well as iterators.
What's included
7 readings6 app items
7 readingsβ’Total 10 minutes
- Navigating Codio Assignmentsβ’5 minutes
- List ADT Lesson Notes (Optional Download)β’0 minutes
- Singly Linked Lists Lesson Notes (Optional Download)β’0 minutes
- Doubly Linked Lists Lesson Notes (Optional Download)β’0 minutes
- Circular Linked Lists Lesson Notes (Optional Download)β’0 minutes
- Iterators Lesson Notes (Optional Download)β’0 minutes
- How to Reset an Assignment in Codioβ’5 minutes
6 app itemsβ’Total 285 minutes
- Codio: List ADTβ’45 minutes
- Codio: Singly Linked Listsβ’45 minutes
- Codio: Doubly Linked Listsβ’45 minutes
- Codio: Circular Linked Listsβ’45 minutes
- Codio: Iteratorsβ’45 minutes
- Codio: List ADT Coding Exercisesβ’60 minutes
Welcome to Week 2 of the Linear Data Structures and Trees course. This module builds upon the list ADT and introduces other commonly used linear data structures like stacks, queues, priority queues, and deques (double-ended queues).
What's included
4 readings5 app items
4 readings
- Stacks (LIFO) Lesson Notes (Optional Download)β’0 minutes
- Queues (FIFO) Lesson Notes (Optional Download)β’0 minutes
- Priority Queues Lesson Notes (Optional Download)β’0 minutes
- Deques Lesson Notes (Optional Download)β’0 minutes
5 app itemsβ’Total 240 minutes
- Codio: Stacks (LIFO)β’45 minutes
- Codio: Queues (FIFO)β’45 minutes
- Codio: Priority Queuesβ’45 minutes
- Codio: Dequesβ’45 minutes
- Codio: Stacks and Queues ADT Coding Exercisesβ’60 minutes
Welcome to Week 3 of the Linear Data Structures and Trees course. This module introduces the first non-linear data structure, trees. Topics include the tree ADT, binary trees, binary search trees, tree traversal, and different searching algorithms for trees.
What's included
4 readings5 app items
4 readings
- Tree ADT Lesson Notes (Optional Download)β’0 minutes
- Tree Traversals Lesson Notes (Optional Download)β’0 minutes
- Binary Trees and Binary Search Trees Lesson Notes (Optional Download)β’0 minutes
- Depth-First and Breadth-First Searches Lesson Notes (Optional Download)β’0 minutes
5 app itemsβ’Total 240 minutes
- Codio: Tree ADTβ’45 minutes
- Codio: Tree Traversalsβ’45 minutes
- Codio: Binary Trees and Binary Search Treesβ’45 minutes
- Codio: Depth-First and Breadth-First Searchesβ’45 minutes
- Codio: Tree ADT Coding Exercisesβ’60 minutes
Welcome to Week 4 of the Linear Data Structures and Trees course. This module builds upon the tree ADT and introduces data structures that reconfigure themselves to maintain balance and good performance. Topics include AVL trees, Red-Black trees, and B-trees.
What's included
3 readings4 app items
3 readings
- AVL-Trees Lesson Notes (Optional Download)β’0 minutes
- Red-Black Trees Lesson Notes (Optional Download)β’0 minutes
- B-Trees Lesson Notes (Optional Download)β’0 minutes
4 app itemsβ’Total 195 minutes
- Codio: AVL-Treesβ’45 minutes
- Codio: Red-Black Treesβ’45 minutes
- Codio: B-Treesβ’45 minutes
- Codio: Self-Balancing Trees Coding Exercisesβ’60 minutes
Earn a career certificate
Add this credential to your LinkedIn profile, resume, or CV. Share it on social media and in your performance review.
Instructor
Offered by
Explore more from Algorithms
- Status: Free Trial
Course
- Status: Free Trial
Course
- Status: Free TrialU
University of Illinois Urbana-Champaign
Course
- Status: Free Trial
Why people choose Coursera for their career
Frequently asked questions
To access the course materials, assignments and to earn a Certificate, you will need to purchase the Certificate experience when you enroll in a course. You can try a Free Trial instead, or apply for Financial Aid. The course may offer 'Full Course, No Certificate' instead. This option lets you see all course materials, submit required assessments, and get a final grade. This also means that you will not be able to purchase a Certificate experience.
When you enroll in the course, you get access to all of the courses in the Specialization, and you earn a certificate when you complete the work. Your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile.
Yes. In select learning programs, you can apply for financial aid or a scholarship if you canβt afford the enrollment fee. If fin aid or scholarship is available for your learning program selection, youβll find a link to apply on the description page.
More questions
Financial aid available,
