Data-Structures-and-Algorithms

Learning Data structures and Algorithms in C programming

Abstract Data Types

List

• Initialize() - Initialize the list to be empty
• get() - Return an element from the list at any given position
• insert() - Insert a new element at any position of the list.
• remove() - Remove first occurence of any element from a non empty
• removeAt() - Remove the element at the specified location from a non empty list
• replace() - Replace an element at any position by another element
• size() - Return the number of element in the list
• isEmpty() - bool : True or False
• isFull() - bool : true | false

Stack

• Initialize() - Initialize the list to be empty
• Push() - Insert
• Pop() - remove
• Peek() - return top element
• size() - Return the number of element in the list
• isEmpty() - bool : True or False
• isFull() - bool : true | false

Queue

• Initialize() - Initialize the list to be empty
• Enqueue() - insert an element at the end of the queue
• Dequeue() - Remove and return the first element of queue
• Peek() - return first elemet
• size() - Return the number of element in the list
• isEmpty() - bool : True or False
• isFull() - bool : true | false