-
Preview
-
Preview
-
Preview
-
Preview
-
Operation-Implementations
-
Deletion
-
Stack Introduction
-
Implementation of Stack ADT Using Arrays
-
Stack Applications Balance Parentheses
-
Example for Conversion of Infix to Postfix
-
Stack Applications-Implementation of Balance Parentheses
-
Stack Applications -Conversion of Infix to Postfix Expression
-
Implementation Conversion of Infix to Postfix Expressions
-
Evaluation of Postfix Expressions With Examples
-
Implementation of Postfix Expressions
-
Queue ADT Using Arrays
-
Implementation of Queue Using Arrays
-
Circular Queue ADT Using Arrays
-
Priority Queue ADT Using Arrays
-
Implementation of Circular Queue Using Arrays
-
Implementation of Priority Queue Using Arrays
-
Advantages, Disadvantages & Applications -Single linked list
-
Double linked list-Introduction
-
Double linked list Creation & Display
-
Implementation of Double linked list Creation & Display
-
Double linked list-Insertion Operations
-
Implementation of Double linked list-Insertion Operations
-
Double linked list-Deletion Operations
-
Implementation of Double linked list-Deletion Operations
-
Circular Linked List-Introduction
-
Circular Linked List-Creation & Display
-
Implementation of Circular Linked List-Creation & Display
-
Circular Linked List-Insertion Operations
-
Circular Linked List-Deletion Operations
-
Text Processing Classifications - Pattern Matching
-
TRIE
-
Graph Introduction
-
Graph Traversal -Breadth First Search (BFS)
-
Implementation of Breadth First Search (BFS)
-
Graph Traversal - Depth First Search (DFS)
-
Implementation of Depth First Search (DFS)
-
Implementation of Brute Force Pattern Matching Algorithm
-
Queue Using Linked List
-
Pattern Matching - Knuth Morris Pratt (KMP)
-
Stack Using Linked List
-
Linear Search
-
Binary Search
-
Sorting Bubble Sort
-
Sorting Insertion Sort
