Module 8: List and Implementation
• What is Linked List
• Why we need Linked List
• Problem in Arrays
• Advantage and Disadvantage of Linked List
• Creating a Linked List
• Operations in a Linked List
o Insertion
o Deletion
o Search
o Display
o Other Operations on Linked List
• Circular Linked List
• Various Operations on Circular Linked list
• Doubly Linked List
• Various Operations on Doubly Linked List
• Doubly Circular Linked list
Module 9: Stack
• What is Stack
• Array Representation of Stack
• Stack using Linked List
• Various Operations on Stack
• Applications of Stack
• Other Applications of Stack
• Advantages and Disadvantages of Stack
Module 10: Queue
• What is Queue
• Types of Queue
• Applications of Queue
• Implementation of Queue in array
• Implementation of Queue in Linked list
• Operation on Queue
• Advantage and Disadvantage of Queue
Module 11: Trees Data Structure and Implementation
• Basic Tree Concepts
• Use of Tree
• Different Type of Trees
• Binary Tree
• Binary Tree Traversal (Inorder, Preorder, and Postorder)
• Different Operations on Tree (Insertion, Deletion, Search, Count)
• Binary tree representation in memory
• Binary search tree
Module 12: Graphs
• Introduction
• Representation of graphs
• Graph traversal
• Depth-First Traversal
• Breadth-First Traversal