Data Structure is a way to store and organize data so that it can be used efficiently. Data structure, way in which data are stored for efficient search and retrieval. Different data structures are suited for different problems. A data structure is a data organization, management, and storage format that enables efficient access and modification.
Abstract Data Type(ADT) - Introduction to data structures - Representation - Implementation - Implementation - Application - Balancing symbols - Conversion of infix to postfix expression - Evaluating a postfix expression - Recursive function call - Linked list ADT - Implementation using arrays - Limitations - Linked list using dynamic variables - Linked implementation of stacks - Circular list - Doubly linked lists. Applications of lists - Polynomial Manipulation - All operation (Insertion, Deletion, Merge, Traversal).
Stack and list : - Representing stack - Queue ADT - circular queue implementation - Double ended Queues - applications of queue. Definition and applications of Stacks, Queues, Linked lists and trees.
General trees - Binary tree - Traversal methods - Expression trees - Game trees. - Binary search trees - AVL trees - Red-Black trees - Threaded binary trees, Max Priority Queue ADT
Splay trees - B Trees - B+ Trees - Tries - Application - Binomial Heaps – Fibonacci Heaps – Disjoint Sets – Amortized Analysis – Accounting method – Potential method – Aggregate analysis.