Buying for a Team? Gift This Course
Wishlisted Wishlist

Please confirm that you want to add Data Structures in C++ to your Wishlist.

Add to Wishlist

Data Structures in C++

Learn and master the popular data structures in C++
3.2 (3 ratings)
Instead of using a simple lifetime average, Udemy calculates a course's star rating by considering a number of different factors such as the number of ratings, the age of ratings, and the likelihood of fraudulent ratings.
216 students enrolled
Created by Nisha Kiran
Last updated 12/2015
$10 $35 71% off
2 days left at this price!
30-Day Money-Back Guarantee
  • 42 mins on-demand video
  • Full lifetime access
  • Access on mobile and TV
  • Certificate of Completion
Have a coupon?
What Will I Learn?
Be able to understand and implement various data structures and use them for various problems
Be able to write your own data structures using these basic data structures
View Curriculum
  • Download Dev C++ as compiler.
  • You should have basic knowledge of C++ as that will not be covered in this course.

Ever wondered how large amounts of data is stored in computers and still accessed efficiently? In computer science, a data structure is a particular way of organizing data so that it can be used efficiently.

In this course, we will learn about these data structures. We will cover the most popular data structures used to store data which includes binary search trees, heaps, hash tables and graphs. Complete with code samples, you'll be able to learn alongside the instructor. This course is designed for programmers with some basic knowledge of C++.

This course is broken down into easy to assimilate lectures and after each section there is problem set which challenges you to work on problems related to that section. The course provides comprehensive explanation of data structures binary search trees, heaps, hash tables and graphs. By the end of this course, you will be able to code these data structures and understand how to perform operations on these data structures.

Who is the target audience?
  • Anyone who wants to learn how to code important data structures in C++
  • Anyone who is appearing for interviews
  • Anyone who wants to brush up data structures in C++
Students Who Viewed This Course Also Viewed
Curriculum For This Course
Expand All 28 Lectures Collapse All 28 Lectures 42:06
Data Structures
1 Lecture 00:26
Binary Search Trees
9 Lectures 17:53

In this lecture, we see how we can represent binary search tree in C++.

Preview 01:51

In this lecture, we look at how to insert values in a binary search tree.

Preview 02:54

This lecture covers the case where the data/value to be deleted in a binary search tree doesn't exist in the tree.

Preview 02:35

In this lecture, we cover the case where the value to be deleted is at the leaf node in the binary search tree.

Preview 01:27

This lecture covers the scenario where we want to delete a node with a single child.

Preview 02:27

This lecture covers the scenario, where the node which is to be deleted has two children.

Deletion: Case 4

In this lecture, we discuss how to do inorder traversal of a binary search tree.

Inorder traversal

In this lecture, we test the code we have written so far for binary search tree.


Practice problem
6 Lectures 10:33

In this lecture, we cover the representation of heap data structures.


This lecture covers how to add elements to a heap and still maintain the heap property.

Adding elements

This lectures covers how to remove the top element from the heap and then reheapify the tree.

Removing top element

In this lecture, we test the add() and the remove() methods for heap.


In this lecture, we will use algorithm and vector package to implement heaps.

Heap using STL

Practice problem
Hash tables
8 Lectures 09:14

In this lecture, we discuss what are hash tables and hash functions.

Hash tables and hash functions

In this lecture, we discuss the Hash Entry class and Hash Table class and their data members and methods for implementation.

Implementation details

In this lecture, we will implement the Hash Entry class as discussed in the previous lecture.

Hash Entry Class: Implementation

In this lecture, we implement the insertion of key, value pair in the hash table.

Hash table: Inserting a key, value pair

In this lecture, we discuss how to implement the find() method in the Hash table.

Hash table: Finding a key, value pair

In this lecture, we discuss the implementation of the remove() method for the Hash Table

Hash table: Deleting a key, value pair

In this lecture, we will test the Hash table class that has been developed in the previous lectures.


Practice problem
4 Lectures 04:00

In this lecture, we will implement adjacency list representation of a graph.

Adjacency list implementation

In this lecture, we implement depth first traversal of a graph.

Depth first traversal

Practice problem
About the Instructor
4.1 Average rating
70 Reviews
2,921 Students
6 Courses

Nisha has been teaching since her grad school years as a Masters student in Computer Science where she worked as a teaching assistant for numerous courses in programming. Currently, she works in the Elearning industry and also helps students with programming problems. Nisha has worked as a software developer for various firms prior to teaching and understands how important it is to have a good grasp over programming fundamentals.

During her grad school, she has gained experience in teaching and how to effectively communicate a concept to someone new to programming. Nisha has worked with numerous students ranging from beginner to advanced and understands the needs of both kinds of audience.

Report Abuse