Refactor queue implementation using linked list with O(1) operations …

[kazisufiyan-k2]

Refactor LinkedQueue implementation for clarity and efficiency

Refactored the LinkedQueue implementation to improve code readability, efficiency, and maintainability.

Key Improvements:
Added O(1) size tracking using an internal _size variable
Replaced inefficient length calculation (O(n)) with constant-time operation
Improved method naming (put/get → enqueue/dequeue) for better clarity
Simplified is_empty() logic
Enhanced overall code structure and readability
Describe your change:

Add an algorithm

Fix a bug or typo in an existing algorithm

Add or change doctests

Documentation change

[algorithms-keeper]

Closing this pull request as invalid

@kazisufiyan-k2, this pull request is being closed as none of the checkboxes have been marked. It is important that you go through the checklist and mark the ones relevant to this pull request. Please read the Contributing guidelines.

If you're facing any problem on how to mark a checkbox, please read the following instructions:

• Read a point one at a time and think if it is relevant to the pull request or not.
• If it is, then mark it by putting a x between the square bracket like so: [x]

NOTE: Only [x] is supported so if you have put any other letter or symbol between the brackets, that will be marked as invalid. If that is the case then please open a new pull request with the appropriate changes.