STACK AND QUEUE
Stack ADT, definition, array and linked implementations, applications-infix to postfix conversion, Postfix expression evaluation, recursion implementation, Queue ADT, definition, array and linked Implementations, Circular queues-Insertion and deletion operations. Linear list ADT-array representation and linked representation, Singly Linked Lists- Operations-Insertion, Deletion, Circular linked lists-Operations for Circularly linked lists, Doubly Linked Lists- Operations- Insertion, Deletion.
Connected book
- 2005
- 9780929306322
- Unknown
Written for
- Institution
- Christ University, Bengaluru
- Course
- CS101
Document information
- Uploaded on
- April 25, 2025
- Number of pages
- 82
- Written in
- 2024/2025
- Type
- Class notes
- Professor(s)
- Gaythri
- Contains
- All classes
Subjects
-
stack
-
queue
-
array
-
linked
-
infix
-
postfix
-
insertion
-
deletion
-
linked list