Fix critical time complexity issue of queue operation in python and javascript

[DingChiLin]

Fixes issue:
A standard Queue data structure should have O(1) time complexity for all basic operations.

Since the following two operations take O(N) time:
self.data.insert(0, x) in python
store.shift(); in javascript

The time complexity of some enqueue and dequeue operation will become O(N) instead of O(1)

Changes:

Major:

1. Rewrite the python and javascript implementation of queue and fix the time complexity issue of enqueue and dequeue from O(N) to O(1).
2. This implementation need users to decide the queue size at initialization.

Minor:

1. Add top operation for getting the top element from queue.
2. remove unrelated dependencies (array) in python implementation.

[AdiChat]

Looks great 😍

Thank you for your contribution.

If you would like to join our internship program and contribute to OpenGenus IQ, let us know and we will be happy to have you onboard

Hope you are enjoying your journey 🚆 with OpenGenus