Data Structures

  

Contents

• Stack and Queues
• Linked Lists
• Polynomials
• Trees
• Graphs

Stack and Queues

• Implementation of Stacks
• Evaluation of Postfix Expression
• Convertion of Infix to Postfix Expression
• Implementation of Queues
• Implementation of Circular Queues

Linked Lists

• Implementation of Singly Linked List
• Implementation of Circular Linked List
• Implementation of Doubly Linked List

Polynomials

• Representation of Polynomials
• Addition of Two Polynomials

Trees

• Binary Search Tree Traversals

Graphs

• Breadth First Search ( BFS )
• Depth First Search ( DFS )
• Transitive Closure