Data Structures in C++
2.2 (17 ratings)
Course Ratings are calculated from individual students’ ratings and a variety of other signals, like age of rating and reliability, to ensure that they reflect course quality fairly and accurately.
297 students enrolled

Data Structures in C++

Learn and master the popular data structures in C++
2.2 (17 ratings)
Course Ratings are calculated from individual students’ ratings and a variety of other signals, like age of rating and reliability, to ensure that they reflect course quality fairly and accurately.
297 students enrolled
Created by Nisha Kiran
Last updated 12/2015
English
English [Auto-generated]
Current price: $13.99 Original price: $19.99 Discount: 30% off
5 hours left at this price!
30-Day Money-Back Guarantee
This course includes
  • 42 mins on-demand video
  • Full lifetime access
  • Access on mobile and TV
  • Certificate of Completion
Training 5 or more people?

Get your team access to 4,000+ top Udemy courses anytime, anywhere.

Try Udemy for Business
What you'll 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
Course content
Expand all 28 lectures 42:06
+ 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
02:58

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

Inorder traversal
01:38

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

Testing
01:41
Practice problem
00:22
+ Heaps
6 lectures 10:33

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

Representation
01:14

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

Adding elements
03:10

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

Removing top element
03:19

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

Testing
01:10

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

Heap using STL
01:27
Practice problem
00:13
+ Hash tables
8 lectures 09:14

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

Hash tables and hash functions
01:03

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

Implementation details
00:48

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

Hash Entry Class: Implementation
01:44

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

Hash table: Inserting a key, value pair
01:11

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

Hash table: Finding a key, value pair
01:24

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

Hash table: Deleting a key, value pair
01:30

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

Testing
01:25
Practice problem
00:09
+ Graphs
4 lectures 04:00
Representation
00:42

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

Adjacency list implementation
01:25

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

Depth first traversal
01:45
Practice problem
00:08
Requirements
  • Download Dev C++ as compiler.
  • You should have basic knowledge of C++ as that will not be covered in this course.
Description

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 this course is for:
  • 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++