Skip to Content
Lessons
Share Exit Fullscreen Back to course
DATA STRUCTURES
    • Abstract Data Type
    • The Stack ADT | Stack Operations
    • Implementation of Stack
    • Stack Application: Balanced Delimiters
    • Stack Application Evaluating Postfix Expressions
    • Queue ADT
    • Implementation of Queue ADT
    • Circular Queue
    • Implementation of Circular Queue
    • Priority Queue
    • Implementation of Priority Queue
    • Introduction to Single Linked List
    • Insertion in Single Linked List
    • Deletion in Single Linked List
    • Implementation of Single Linked List
    • Introduction to Double Linked List
    • Insertion in Double Linked List
    • Deletion in Double Linked List
    • Implementation of Double Linked List
    • Circular Single Linked List
    • Insertion in Circular Single List
    • Display in Circular Single Linked List
    • Deletion in Circular Single Linked List
    • Implementation of Circular Single Linked List
    • Introduction to Circular Double Linked List
    • Insertion in Circular Double Linked List
    • Display in Circular Double Linked List
    • Deletion in Circular Double Linked List
    • Implementation of Circular Double Linked List
    • Stack Using Linked List
    • Stack Implementation Using Linked List
    • Queue Using Linked List
    • Queue Implementation Using Linked List
    • Linear Search Algorithm
    • Implementation of Linear Search
    • Binary Search Algorithm
    • Implementation of Binary Search
    • Bubble Sort Algorithm
    • Implementation of Bubble Sort
    • Selection Sort Algorithm
    • Implementation of Selection Sort
    • Insertion Sort Algorithm
    • Implementation of Insertion Sort
    • Quick Sort
    • Implementation of Quick Sort
    • Merge Sort Algorithm
    • Implementation of Merge Sort Algorithm
    • Heap Sort
    • Comparison of Sorting Algorithms
    • Introduction to Tree Data Structure (Tree Terminology)
    • Representation of Tree Data Structure
    • Binary Tree
    • Binary Tree Traversals
    • Binary Search Trees (Insertion)
    • Binary Search Trees (Deletion)
    • Binary Search Trees (Search)
    • AVL Trees (Search)
    • AVL Trees (Delection)
    • AVL Trees (Search)
    • AVL Trees (Example)
    • B-Tree Introduction B-Tree of order m & Height of a B-Tree
    • B-Tree (Insertion)
    • B-Tree (Delete)
    • Red-Black Trees
    • Splay Trees
    • Comparison of Search Trees
    • Graphs: Introduction, Definition, Terminology
    • Graphs Representations: Adjacency Matrix, Adjacency Lists
    • Graph Traversal - DFS
    • Graph ADT
    • Graph Traversal - BFS
    • Dijkstra's Algorithm
    • Bellman - Ford Algorithm
    • Floyd Warshall Algorithm