-
Notifications
You must be signed in to change notification settings - Fork 271
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
Add Queue #22
Labels
Comments
czgdp1807
added
good first issue
Good for newcomers
miscellaneous_data_structures
labels
Jun 28, 2019
Can you please assign this issue to me??also I am new to python so I might take some time. |
You can start working on this issue. Take your time for creating a PR for this. |
thanks |
For data type what are the parameters that we have to consider? |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Description of the problem
Currently we use
Queue
fromcollections
module. We want that this should be implemented inpydatastructs
itself, however, without breaking the current code, i.e., the API should be similar to the one ofcollections
module.API:
An empty queue should be constructed by using
Queue()
.New elements should be added to the end by using
.append(elem)
.The elements should be removed from the front using
.popleft()
.The number of elements in the queue should be returned by
len
i.e,__len__
method should be over-rided in theQueue
class.Example of the problem
References/Other comments
See the code of
OneDimensionalSegmentTree
inpydatastructs.tree.space_partitioning.trees
andBinaryTreeTraversal.breadth_first_search
to know more about the API requirements.The text was updated successfully, but these errors were encountered: