Question: Is insertion / deletion faster in a LinkedList ( LL ) as compared with an array? Group of answer choices Yes, as in LL there
Is insertiondeletion faster in a LinkedList LL as compared with an array?
Group of answer choices
Yes, as in LL there is no bit shifting required
Array are faster in contrast with a LinkedList
Due to linear traversing in LinkedList these operations are slow
None of the options
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
