title: Time Complexity in singly link list
body: <p>I am studying data-structure: singly link list. </p>
  
  <p>The website says singly linked list has a insertion and deletion time complexity of <code>O(1)</code>. Am I missing something?</p>
  
  <p><a href="http://bigocheatsheet.com/" rel="noreferrer">website link</a></p>
  
  <p><a href="https://i.stack.imgur.com/d1jQc.png" rel="noreferrer"><img src="https://i.stack.imgur.com/d1jQc.png" alt="enter image description here"></a></p>
  
  <p>I do this in C++, and I only have a <code>root pointer</code>.  If I want to insert at the end, then I have to travel all the way to the back, which means <code>O(n)</code>. </p>