6

It seems, if I'm not wrong, that because of the way 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?

Improve this question

3 Answers 3

Reset to default
4

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.

Improve this answer
Sign up to request clarification or add additional context in comments.

1 Comment

I am stunned, and I got totally misinformed... I'll have to check next time I ask someone if he's good in JavaScript... And thanks, splice was what I was looking for :)
3

Actually Array supports push and pop operations: JavaScript Array Object

Improve this answer

Comments

1

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

Improve this answer

1 Comment

As well as shift and unshift. Note the footer on the listed page that provides "try it now" versions of all the methods.

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.