HOME > Development > Data Structures in C++_1

Data Structures in C++_1

  • Development
  • May 14, 2025
SynopsisData Structures in C++, available at Free, has an average rat...
Data Structures in C++_1  No.1

Data Structures in C++, available at Free, has an average rating of 4.6, with 35 lectures, based on 757 reviews, and has 30658 subscribers.

Free Enroll Now

You will learn about Learn How To Implement Basic Data Structures This course is ideal for individuals who are Individuals with the desire to learn about data structures and how to implement their own data structures It is particularly useful for Individuals with the desire to learn about data structures and how to implement their own data structures.

Enroll now: Data Structures in C++

Summary

Title: Data Structures in C++

Price: Free

Average Rating: 4.6

Number of Lectures: 35

Number of Published Lectures: 35

Number of Curriculum Items: 35

Number of Published Curriculum Objects: 35

Original Price: Free

Quality Status: approved

Status: Live

What You Will Learn

  • Learn How To Implement Basic Data Structures
  • Who Should Attend

  • Individuals with the desire to learn about data structures and how to implement their own data structures
  • Target Audiences

  • Individuals with the desire to learn about data structures and how to implement their own data structures
  • 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.

    Course Curriculum

    Chapter 1: Introduction

    Lecture 1: Requirements and Curriculum

    Chapter 2: Linked List (Singly Linked List)

    Lecture 1: Linked List Overview : Intro To Linked List

    Lecture 2: Appending To A Linked List

    Lecture 3: Prepending To A Linked List

    Lecture 4: Printing Out Our Linked List

    Lecture 5: Remove First Node From Our Linked List

    Lecture 6: Remove Last Node From Our Linked List

    Lecture 7: Remove Node At A Certain Position From Our Linked List

    Lecture 8: Insert Node At A Certain Position Within Our Linked List

    Lecture 9: Linked List Destructor

    Chapter 3: Doubly Linked List

    Lecture 1: Doubly Linked List Overview : Intro to Doubly Linked List

    Lecture 2: Prepending To A Doubly Linked List

    Lecture 3: Appending To A Doubly Linked List

    Lecture 4: Insert Node At A Certain Position Within Our Doubly Linked List

    Lecture 5: Printing Out Our Doubly Linked List In Reverse

    Lecture 6: Remove First Node From Our Doubly Linked List

    Lecture 7: Remove Node At A Certain Position From Our Doubly Linked List

    Lecture 8: Remove Last Node From Our Doubly Linked List

    Lecture 9: Insert Node At A Certain Position Within Our Doubly Linked List

    Chapter 4: Stacks (Abstract Data Types)

    Lecture 1: Stack Overview

    Lecture 2: Implementing a Stack using an Array

    Lecture 3: Implementing a Stack using a Linked List

    Chapter 5: Queue (Abstract Data Types)

    Lecture 1: Queue Overview

    Lecture 2: Implementing a Queue using an Array

    Lecture 3: Implementing a Queue using a Linked List

    Chapter 6: Binary Search Tree (Abstract Data Types)

    Lecture 1: Binary Search Tree Overview

    Lecture 2: Binary Search Tree Insert Overview

    Lecture 3: Binary Search Tree Insert Method

    Lecture 4: Binary Search Tree Deletion Overview

    Lecture 5: Binary Search Tree Deletion Method

    Chapter 7: Binary Min/Max Heap

    Lecture 1: Binary Min/Max Heap Overview

    Lecture 2: Binary Min/Max Heap Insert Overview

    Lecture 3: Binary Min/Max Heap Insert (Array Recursive Implementation)

    Lecture 4: Binary Min/Max Heap Deletion Overview

    Lecture 5: Binary Min/Max Heap Deletion (Array Recursive Implementation)

    Instructors

  • Data Structures in C++_1  No.2
    Pedro Mercado
    Programmer
  • Rating Distribution

  • 1 stars: 23 votes
  • 2 stars: 22 votes
  • 3 stars: 116 votes
  • 4 stars: 301 votes
  • 5 stars: 295 votes
  • Frequently Asked Questions

    How long do I have access to the course materials?

    You can view and review the lecture materials indefinitely, like an on-demand channel.

    Can I take my courses with me wherever I go?

    Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don’t have an internet connection, some instructors also let their students download course lectures. That’s up to the instructor though, so make sure you get on their good side!