title: What are the time complexities of various data structures?
body: <p>I am trying to list time complexities of operations of common data structures like Arrays, Binary Search Tree, Heap, Linked List, etc. and especially I am referring to Java. They are very common, but I guess some of us are not 100% confident about the exact answer. Any help, especially references, is greatly appreciated.</p>
  
  <p>E.g. For singly linked list: Changing an internal element is O(1). How can you do it? You <em>HAVE</em> to search the element before changing it. Also, for the Vector, adding an internal element is given as O(n). But why can't we do it in amortized constant time using the index? Please correct me if I am missing something.</p>
  
  <p>I am posting my findings/guesses as the first answer. </p>