In this video, We are explaining Data Structures and Algorithms Full Tutorial. Please do watch the complete video for in-depth information.

Breakdown of Content in this Video :

• 04:20 - introduction data structure & Algorithm
• 08:41 - Types of Data Structure
• 25:33 - Asymptotic Notations
• 54:58- Array in dsa
• 01:15:04 - Concepts of the stack
• 01:39:13 - Tower of Hanoi
• 01:53:01 - evaluation of postfix & infix
• 02:09:10 - infix to postfix conversion
• 02:22:43 - infix to postfix conversion with help of stack concepts
• 02:36:17 -queue
• 02:49:54 - circulate queue
• 03:04:12 - linked list in dsa
• 03:23:22 - circulate linked list in dsa
• 03:34:13 - doubly linked list in dsa
• 03:47:21 - tree in dsa
• 04:10:07 - binary tree
• 04:22:57 - representation of a binary tree
• 04:36:00 - preorder traversals
• 04:47:36 - in order traversal
• 04:57:15 - post order traversal
• 05:07:25 - binary search tree
• 05:21:39 – Deletion into Binary Search tree
• 05:34:24 - AVL tree in dsa
• 05:53:08 - AVL tree insertion
• 06:14:43 - AVL tree rotation
• 06:32:28 - AVL tree Examples
• 06:46:57 - insertion in heap tree
• 07:03:09 - deletion in heap tree
• 07:13:04 - B tree insertion
• 07:28:43 - introduction to graph
• 07:51:25 - representation of a graph
• 08:05:27 - spanning tree
• 08:23:36 - prim’s algorithm
• 08:33:39 - shortest path algorithm
• 08:53:44 - graph traversal
• 09:04:19 - graph traversal Depth-first search

#algorithms #data-structures #developer