
UdemyThis intermediate course walks through data structures the way a computer science curriculum would: starting with linked lists and doubly linked lists, then moving into Abstract Data Types — the idea that a structure is defined by what it must do, not how it's built. A stack, for instance, is defined by its push and pop operations.
Programmers with some C++ experience who want to understand the mechanics behind the structures they already use, or who are preparing for technical interviews and coursework that assumes this foundation.
The progression from linked lists to trees and heaps gives a solid base for further algorithms and interview prep.
In this course, we're going to be learning about data structures using C++. We're going to be covering with Linked List and Doubly Linked list data structures. Afterwards we will be covering Abstract Data Types. An Abstract Data Type describes what is expected from a data structure. For example a Stack must have a push and pop method. So we will be covering the following Abstract Data Types, such as a Stack,Queue,Binary Search Tree, Min/Max Heap.
Price
This course is free to enrol.
Advertisement
More in Development



