Ementorhub

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

Algorithms

Object Oriented Programming (OOP)

Theoretical Computer Science

Data Structures

Programming Principles

C++ (Programming Language)

There are 4 modules in this course

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.

Stacks and Queues ADT

Tree ADT

Self-Balancing Trees