Add `multiset` to `pydatastructs.miscellaneous_data_structures`

[Muskan0]

Description of the problem

https://github.com/codezonediitj/pydatastructs/issues/390#issuecomment-986180523

We do have SelfBalancingBinaryTree we just need to put pop method (which is basically show top and delete). Apply pop enough time and we have tree sort. My point being that we don't need to reinvent anything.

References

[Komal-99]

I would like to work kn this issue kindly assign it to me .I am gssoc'21 participant

[Smit-create]

Can we create a multiset using this? I would prefer having the implementation which is available in CPP where Insert, deletion, and count works in O(logN)?

[Muskan0]

@Smit-create Can I do it in Python?

[Amulya310]

Please assign this issue to me under Gssoc'21.

[HarsheetKakar]

Can we create a multiset using this? I would prefer having the implementation which is available in CPP where Insert, deletion, and count works in O(logN)?

We do have SelfBalancingBinaryTree we just need to put pop method (which is basically show top and delete). Apply pop enough time and we have tree sort. My point being that we don't need to reinvent anything.

[czgdp1807]

We already have plenty of sorting algorithms. Having one more makes sense? Though I like the idea of multiset, it is a data structure worth adding.

[CoderAndroid746]

Kindly assign this issue to me under Gssoc'22

[czgdp1807]

@Smriti123Shukla You can go ahead with adding multiset. We don't assign issues. Please read, https://github.com/codezonediitj/pydatastructs/wiki/Issue-Policy