Codio
C++: Linear Data Structures and Trees
Codio

C++: Linear Data Structures and Trees

Patrick Ester

Instructor: Patrick Ester

Included with Coursera Plus

Gain insight into a topic and learn the fundamentals.
Intermediate level

Recommended experience

16 hours to complete
3 weeks at 5 hours a week
Flexible schedule
Learn at your own pace
Gain insight into a topic and learn the fundamentals.
Intermediate level

Recommended experience

16 hours to complete
3 weeks at 5 hours a week
Flexible schedule
Learn at your own pace

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.

Details to know

Shareable certificate

Add to your LinkedIn profile

Taught in English

See how employees at top companies are mastering in-demand skills

Placeholder
Placeholder

Earn a career certificate

Add this credential to your LinkedIn profile, resume, or CV

Share it on social media and in your performance review

Placeholder

There are 4 modules in this course

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

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

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

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

Instructor

Patrick Ester
Codio
30 Courses71,474 learners

Offered by

Codio

Why people choose Coursera for their career

Felipe M.
Learner since 2018
"To be able to take courses at my own pace and rhythm has been an amazing experience. I can learn whenever it fits my schedule and mood."
Jennifer J.
Learner since 2020
"I directly applied the concepts and skills I learned from my courses to an exciting new project at work."
Larry W.
Learner since 2021
"When I need courses on topics that my university doesn't offer, Coursera is one of the best places to go."
Chaitanya A.
"Learning isn't just about being better at your job: it's so much more than that. Coursera allows me to learn without limits."

New to Algorithms? Start here.

Placeholder

Open new doors with Coursera Plus

Unlimited access to 10,000+ world-class courses, hands-on projects, and job-ready certificate programs - all included in your subscription

Advance your career with an online degree

Earn a degree from world-class universities - 100% online

Join over 3,400 global companies that choose Coursera for Business

Upskill your employees to excel in the digital economy

Frequently asked questions