Stack And Queue Programs Notes

DATA STRUCTURE IN PYTHON (STACK OR QUEUE) A data structure is a group of data that can be characterised by its organization and the operations that are defined on it. Hence Data structure = organized data +allowed operations. Operations on Data Structure Traversing: Accessing each node exactly once so that certain elements of the record may be processed. Inserting: Adding a new Record to the structure Deleting: Removing a record from the structure. Sorting: Arranging the record either in ascending or in desending order according to some key. Searching: Finding the location of the record with a given key value Merging: Combing the Record in two different sorted file into a single sorted file DATA STRUCTURE: IN DATA STRUCTURE DATA IS IMPLEMENTED BY TWO TYPE ARE: (A) Stack (B) Queue STACK: A Stack is a structure that follows the concept of LIFO.(Last In First Out). A stack is a structure where insertion and deletion takes place from a single end called Top.QUEUE: A Queue is a structure that follows the concept of FIFO (First in First Out) A Queue is a structure where elements deletion takes place from a one end called front and insertion takes place at other end