Data Structure with C++ : Zero to Hero

Learn about Pointers , Arrays, Linked Lists, Stacks and Queues, Graph, Binary Trees, Heap & Priority Queue, Sorting etc.

4.34 (19 reviews)

Udemy

platform

English

language

Software Engineering

What you will learn

Apply features of c++ such as pointers, references, arrays, classes, templates, function overloading, virtual functions, exception handling etc.

Understand the nuances of object oriented programming, e.g. abstraction, encapsulation, polymorphism, inheritance etc.

Conceptualize the idea of basic data structures, viz. linked lists, stacks, queues, graphs, binary trees, heaps, binary search trees, AVL trees etc.

Implement the basic as well as your own (more complex) data structures in c++

Recognize various techniques of sorting a collection and develop them in c++

Search for something in a collection

Solve problems related to data structures using the tools and techniques of c++

Pointers and References: Understanding the Core

Pointers and References: passing agrument by value, pointer & reference

Pointers and References: const pointer, const reference, cons function

Arrays: Understanding the Core of Array and Why it is Important

Arrays: Row Major and Column Major Representation of Array

Linked Lists : Understanding the concepts of Linked list and Why we use linked list

Linked Lists : How to Insert Element in a Linked List

Linked Lists : How to Delete Element in a Linked List

Linked Lists : How to Reversed a Linked List

Linked Lists : Understanding Doubly Linked Lists with Live Coding

Linked Lists : Understanding Circularly Linked Lists with Live Coding

Linked Lists : Application of Linked Lists

Stacks and Queues : Understanding Why and How we use Stacks and Queue

Stacks : Implementation of Stack using Array

Stacks : Implementation of Stack using Linked List

Stacks : infix to postfix

Stacks : postfix evaluation

Queues : Queue using array

Queues : Queue using linked list

Graph: Why and How we use use Graph

Graph : Adjacency Matrix and Adjacency List representations

Graph : Reading a graph from a file

Graph : Breadth First Search (BFS)

Graph : Depth First Search (DFS)

Binary Trees: Why, How and Where we use Binary Trees

Binary Trees: Binary Tree Traversal

Binary Trees: Implementation of Binary Tree

Binary Trees: Binary Search Tree

Binary Trees: Implementation of Binary Search Tree

Binary Trees: Understanding Red Black Tree

Binary Trees: Insertion in a Red Black Tree

Binary Trees: Deletion from a Red Black Tree

Understanding Heap

Implementation of Heap Sort

Understanding Priority Queue & Implementation

Sorting : Selection Sort

Sorting : Insertion Sort

Sorting : Bubble Sort

Sorting : Quick Sort

Sorting : Merge Sort

Sorting : Radix Sort

Searching : Linear Search

Searching : Binary Search

Searching : Interpolation Search

Hashing