Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Included some data structures: Array and Queue #677

Open
wants to merge 5 commits into
base: main
Choose a base branch
from

Conversation

gurpreetk3012
Copy link

Issue #332 Resolved

Summary: This pull request resolves issue #332 by adding implementations for the following data structures to the repository:

  1. Array
  • Insert an element at a specified location.
  • Access/Search for an element.
  • Delete an element from a specified location.
  1. Queue
  • Add (enqueue) an element.
  • Peek at the front element.
  • Remove (dequeue) an element.

Implementation Details:

Array: The array operations enable insertion, search, and deletion functionalities at specified indices, providing a clear demonstration of fundamental array manipulation techniques.
Queue: The queue implementation includes standard enqueue, peek, and dequeue methods, simulating a basic First-In-First-Out (FIFO) data structure.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants