title: What to use ArrayList or LinkedList or TreeMap?
body: <p>In my problem I have a large set of numbers. At run time I want to insert a number into this sorted series of numbers and grab the number which is next (Ascending next) to the inserted number (Everything is sorted) and then delete the inserted number. </p>
  
  <p>There is one more constraint, sometimes The number I want to insert would be exactly equal to some other number in my initial set, in this case too I want to grab the next number. </p>
  
  <p>I am confused whether I should use a TreeMap (As a TreeMap is always sorted, but comes with an overhead of a key) A LinkedList (Because entering and removing values becomes easier) or a simple 
  ArrayList? </p>
  
  <p>I am loading these numbers into memory and performing intense calculations, my platform is mobile and so I want something which is efficient. Any hints? So far I am using a Linked list although I am not facing any performance issues but I would want to speed up the process.  </p>