Click on the link to watch the video
- Introduction to DATA STRUCTURES
- Data Structures – Abstract Data Types
- Basics Of Asymptotic Notation
- Analyzing Iterative Code Program
- Understanding Linear Search
- Understanding Binary Search
- Selection Sort
- Bubble Sort
- Insertion Sort
- Basics Of Linked List
- How To Add Nodes To Linked List
- How To Delete Node From Linked List
- How To Insert Node In Circular Linked List
- How To Delete Node From A Circular Linked List
- How To Add Node To Doubly Linked List
- How To Delete Node From A Double Linked List
- Analysis Of Linked List Operations
- What Is Stack Data Structure
- How To Implement Push And Pop Operations Using Linked List And Arrays
- How To Implement Parenthesis Checker Using Stack
- How To Convert Infix To Postfix Expression
- How To Evaluate Postfix Expressions
- How To Convert Infix Expression To Prefix Expression- Method1
- How To Covert Infix Expression To Prefix Expression Using Postfix Expression
- How To Evaluate Prefix Expression- Algorithm With Example
- Introduction To Queue Data Structure
- How To Implement Linear Queue Using Array And Linked List
- Introduction To Circular Queue And Its Implementation
- Understanding Circular Queue Operations With An Illustrative Example
- Understanding Double Ended Queue (Deque) OPerations in Hindi
- Introduction To Tree Data Structures
- Binary Trees And It Representation In Memory
- Traversing A Binary Tree – Preorder, Postorder & Inorder Traversal
- Constructing Binary Tree Using Given Traversing Sequences
- Constructing Binary Tree using PostOrder and PreOrder Traversals
- Understanding Expression Tree data structure
- Constructing Expression Tree from Postfix notation
- Constructing Expression tree from Prefix Notation
- Binary Search Tree – Fundamentals
- How To Perform Search & Insert Operation In Binary Search Tree (BST)
- How To Delete Node In Binary Search Tree
- Threaded Binary Tree – Fundamentals
- Adding Node In Threaded Binary Tree
- Deleting a Node in Threaded Binary Tree
- Graphs In Data Structures
- Finding Transitive Closure Of Graph
- Graph Representation In Computer’s Memory
- Breadth First Search (BFS) Traversal Algorithm
- Depth First Search (DFS) Traversal Algorithm And Example
- Introduction to Avl Trees & Adding Node to It
- How To Delete Node From a AVL Tree
- Illustrative Example Of Adding & Deleting Node In AVL Tree
- Huffmann Encoding
- Comparing Encoding Schemes – (Default necoding- Uniform encodin – Variable encoding)
- M Way Search Tree
- B Tree
- Illustrative Examples of Deleting a Node in a B tree
- Illustrative Examples of Inserting a Node in a B tree
- Illustrative Examples of Inserting a Node in a B+ tree
- Illustrative Examples of Deleting a Node in a B+ tree
Expertvision 