I know my question is very much similar to one which are posted previously.I have gone through multiple post for this but still not very much clear with the answer.That's why i am posting it again.
Why Linked HashMap uses doubly LinkedList over Single LinkedList while order can also be maintained through Single LinkedList.
In answers of some of the previous post it was mentioned that LinkedHashMap provides O(1) complexity for deletion because it has previous as well as next element pointer but i think HashMap also provides O(1) for deletion.
Thanks,