Data Structures (English)

   Thursday, September 10, 2020   

Starting a new Lecture Notes Series on Data Structures

Youtube Lecture Playlist Credits: 

Channel Name: mycodeschool

So Let Us Start to This Journey of Learning 

Data Structures By Lecture Notes together!

Click Here!

 

Lecture Description of this above Topic:

Lecture 1: Introduction to data structures

Lecture 2: Data Structures: List as abstract data type

Lecture 3: Introduction to linked list

Lecture 4: Data Structures: Arrays vs Linked Lists

Lecture 5: Linked List - Implementation in C/C++

Lecture 6: Linked List in C/C++ - Inserting a node at beginning

Lecture 7: Linked List in C/C++ - Insert a node at nth position

Lecture 8: Linked List in C/C++ - Delete a node at nth position

Lecture 9: Reverse a linked list - Iterative method

Lecture 10: Print elements of a linked list in forward and reverse order using recursion

Lecture 11: Reverse a linked list using recursion

Lecture 12: Data structures: Introduction to Doubly Linked List

Lecture 13: Doubly Linked List - Implementation in C/C++

Lecture 14: Data structures: Introduction to stack

Lecture 15: Data structures: Array implementation of stacks

Lecture 16: Data Structures: Linked List implementation of stacks

Lecture 17: Reverse a string or linked list using stack.

Lecture 18: Check for balanced parentheses using stack

Lecture 19: Infix, Prefix and Postfix

Lecture 20: Evaluation of Prefix and Postfix expressions using stack

Lecture 21: Infix to Postfix using stack

Lecture 22: Data structures: Introduction to Queues

Lecture 23: Data structures: Array implementation of Queue

Lecture 24: Data structures: Linked List implementation of Queue

Lecture 25: Data structures: Introduction to Trees

Lecture 26: Data structures: Binary Tree

Lecture 27: Data structures: Binary Search Tree

Lecture 28: Binary search tree - Implementation in C/C++

Lecture 29: BST implementation - memory allocation in stack and heap

Lecture 30: Find min and max element in a binary search tree

Lecture 31: Find height of a binary tree

Lecture 32: Binary tree traversal - breadth-first and depth-first strategies

Lecture 33: Binary tree: Level Order Traversal

Lecture 34: Binary tree traversal: Preorder, Inorder, Postorder

Lecture 35: Check if a binary tree is binary search tree or not

Lecture 36: Delete a node from Binary Search Tree

Lecture 37: Inorder Successor in a binary search tree

Lecture 38: Data structures: Introduction to graphs

Lecture 39: Data structures: Properties of Graphs

Lecture 40: Graph Representation part 01 - Edge List

Lecture 41: Graph Representation part 02 - Adjacency Matrix

Lecture 42: Graph Representation part 03 - Adjacency List