• Concept
• Addition and Deletion of an element
• Traversing of list
• Searching for a particular key
• Ascending and descending order sort

• concept
• Addition and deletion of a node
• List traversal
• Sorting of list
• Key search
• Space and time complexity (to be added later)

• Addnode and deletenode operation
• List traversal
• Space and time complexity (to be added later)

• Stack & Queues
• Stack concepts
• Array implementation of stacks - push & pop
• Linked list implementation of stack - push & pop
• Application of stacks
• Queue concepts
• Array implementation of queues - insert & delete
• Linked list implementation of queue - insert & delete
• Application of queues
• Circular Queues – insert & delete
• Priority Queues – add and delete node operations
• Deques – add and delete node operations
• Implementation of Stacks and queues using Doubly Linked List – advantages of this implementation

• Graphs
• Concept --  non-directed, directed and weighted
• Adjacency matrix of a Graph
• Traversals – Depth First & Breadth first Search
• Linked list representation of a Graph
• Transitive closure/ Warshall’s algorithm
• Shortest Path Algorithm
• Spanning Tree Algorithm

• Trees
• Trees – concepts
• Binary tree and its creation
• Traversals of a binary tree – preorder, inorder and postorder
• Recursive and non-recursive implementation of traversals
• Binary threaded tree
• Expressions-to-Trees
• Balanced trees / AVL trees – Creation and Balancing of a binary tree
• Balanced m-way tree / B-tree – Creation and balancing

• Sparse Matrix
• Array representation
• Linked list representation
• Addition and Multiplication using linked list and array representation

• Sorting and Searching
• Types of Sort – Quick, Bubble, Merge, Insertion and Heap
• Binary Search Technique
• Time and space complexity (to be added later)

Index || Doubts / Clarifications || Related Topics ||Web Links