Javascript list like data structure?

It seems, if I'm not wrong, that because of the way 开发者_JS百科Javascript handles Objects it is unpractical or inefficient to implement linked lists.

I would need a data structure in which I could easily do 2 operations(apart from indexing), appending at the end and removing (popping) an object at a given index.

Is using an Array and "recreating" it for each remove operation the optimal solution? I would think not.

Any ideas?

It sounds like the JS Array is exactly what you're looking for.
You should be able to use the push and pop functions for the stack-like data structure and splice for the rest of it.

Actually Array supports push and pop operations: JavaScript Array Object

You don't have to recreate the Javascript array for each removal. Javascript Arrays have push() and pop() methods to add and remove elements:

JavaScript Array Object