title: While implementing Queue using Linked List, Why is insertion complexity O(1)?
body: <p>I read my book where it is written that insertion and deletion from queue using Linked List both has O(1) complexity but my understanding is for deletion it'll be O(1) but for insertion it is O(n) because it'll traverse till end pointer.</p>