This is my repository for Data Structures using Python. This repository mainly aims at implementation of various Data Structures using Python. Vedant Kakade,
Wardha, Maharashtra, India.

• Arrays Concept
  • Array implementation
  • Reversing an Array
  • Array Rotation
  • Get the missing number
  • Check the number that occurs odd number of times
  • Determine two elements in an array whose sum is equal to specified sum

• Linked Lists Concept
  • Singly Linked List implementation
  • Doubly Linked List implementation
  • Finding the length of linked list
  • Reversing the linked list

• Stack Concept
  • Stack implementation
  • Infix to Postfix conversion
  • Balanced Parenthesis
  • Decimal to Binary conversion using Stack
  • Reversing a String using stack

• Queue Concept
  • Queue implementation
  • Circular Queue
  • Double Ended Queue
  • Priority Queue

• Tree Concept
  • Tree implementation
  • Binary Search Tree
  • Breadth First Traversal
  • Count Leaf Nodes
  • Construct tree from inorder and preorder
  • Finding root to leaf paths
  • Finding the inorder predecessor and successor

• Graph Concept
  • Graph implementation
  • Breadth First Search Traversal
  • Depth First Search Traversal
  • Detect Cycle in Directed Graph
  • Detect Cycle in Undirected Graph
  • Topologocal Sort
  • Prim's Algorithm using Adjacency Matrix

• Heap Concept
  • Heap implementation (Min Heap)
  • Heap Sort
  • Implementing a Max Heap

• Fibonacci Series
• Longest Increasing Subsequence
• Longest Continuous Odd Subsequence
• Count Minimum Number of Coins