Data Structures in C++

For Beginners
Rating: 4.0 out of 5 (298 ratings)
11,483 students
Data Structures in C++
Rating: 4.0 out of 5 (298 ratings)
11,483 students
Learn How To Implement Basic Data Structures

Requirements

  • Basic C++ Programming Knowledge
Description

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.

Who this course is for:
  • Individuals with the desire to learn about data structures and how to implement their own data structures
Curriculum
7 sections • 35 lectures • 3h 54m total length
  • Requirements and Curriculum
  • Linked List Overview : Intro To Linked List
  • Appending To A Linked List
  • Prepending To A Linked List
  • Printing Out Our Linked List
  • Remove First Node From Our Linked List
  • Remove Last Node From Our Linked List
  • Remove Node At A Certain Position From Our Linked List
  • Insert Node At A Certain Position Within Our Linked List
  • Linked List Destructor
  • Doubly Linked List Overview : Intro to Doubly Linked List
  • Prepending To A Doubly Linked List
  • Appending To A Doubly Linked List
  • Insert Node At A Certain Position Within Our Doubly Linked List
  • Printing Out Our Doubly Linked List In Reverse
  • Remove First Node From Our Doubly Linked List
  • Remove Node At A Certain Position From Our Doubly Linked List
  • Remove Last Node From Our Doubly Linked List
  • Insert Node At A Certain Position Within Our Doubly Linked List
  • Stack Overview
  • Implementing a Stack using an Array
  • Implementing a Stack using a Linked List
  • Queue Overview
  • Implementing a Queue using an Array
  • Implementing a Queue using a Linked List
  • Binary Search Tree Overview
  • Binary Search Tree Insert Overview
  • Binary Search Tree Insert Method
  • Binary Search Tree Deletion Overview
  • Binary Search Tree Deletion Method
  • Binary Min/Max Heap Overview
  • Binary Min/Max Heap Insert Overview
  • Binary Min/Max Heap Insert (Array Recursive Implementation)
  • Binary Min/Max Heap Deletion Overview
  • Binary Min/Max Heap Deletion (Array Recursive Implementation)

Instructor
Programmer
Pedro Mercado
  • 4.1 Instructor Rating
  • 2,996 Reviews
  • 85,961 Students
  • 4 Courses

A recent Graduate with a Bachelor of Arts degree in Computer Science from Queens College as well as an Associate of Applied Science in Internet Technologies from Queens Borough Community College. I enjoy developing web applications in java spring as well as in angularjs. I also enjoy learning new technologies.