Data Structures And Algorithms For Stack, Queue & LinkedList

Learn Data Structures and algorithms for Stack, Queue and Linked List from scratch using C programming.

What you’ll learn

• Stack, Bracket checker program, Polish Notations infix to postfix conversion, FIFO Queue, Circular Queue, Double Ended Queue, Linked List – Linear, double and Circular – all operations, Stack and Queue using Linked List

• What is Data Structures And Algorithms For Stack, algorithms for Push and Pop operation. Implementation of Stack data structure using C.

• Data Structures And Algorithms For Stack Using Stack – checking brackets in an expression

• Data Structures And Algorithms For Stack Using Stack – Understanding Polish notations, algorithm and implementation of infix to postfix conversion and evaluation of postfix expression
• What is a FIFO Queue, understanding Queue operations – Insert and delete, implementing FIFO Queue
• Limitations of FIFO queue, concept of Circular Queue – Implementation of Circular queue.
• Concept of Double ended queue, logic development and implementation of double ended queue.
• Concept of Linked List – definition, why we need linked list.
• Singly Linked List – developing algorithms for various methods and then implementing them using C programming
• Doubly Linked List – developing algorithm of various methods and then implementing them using C programming
• Circular Linked List – developing algorithm of various methods and then implementing them using C programming