Linked Lists, Queue, Stacks
You are required to recreate the Generic classes for:
📌 Singly Linked list
📌 Stack
📌 Queue
📝 The Stack class should have the following methods
✅ IsEmpty() - returns true if the stack is empty and false is it isn’t
✅ Push(T item) – adds an item to the top of the stack
✅ Pop() – removes and returns the last item added to the stack
✅ Peek() - returns the last item added to the stack
✅ Size() - shows the number of items currently in the stack
📝 The Queue class should have the following methods:
✅ IsEmpty() - returns true if the queue is empty and false is it isn’t
✅ Enqueue(T item) – adds an item to the tail of the queue
✅ Dequeue() - removes and returns the item at the head of the queue
✅ Size() - shows the number of items currently in the queue
📝 The LinkedList class should have the following methods:
✅ Add(T item) - adds an item to the tail of the LinkedList and returns the linked list’s size
✅ Remove(T item) - removes the first occurrence of an item in the linked list, returns true if said item is found and removed or returns false otherwise
✅ Check(T item) - checks for a specified item in the linked list. Returns a Boolean
✅ Index(T item) - returns the index of an item or returns -1 if the item isn’t found