title: Data structure with fast insertion
body: <p>I would like to implement data structure which is able to make fast insertion and keeping data sorted, without duplicates, after every insert.</p>
  
  <p>I thought about binomial heap, but what I understood about that structure is that it can't tell during insertion that particular element is yet in heap. On the another hand there is AVL tree, which fits perfectly for my case, but honestly there are rather too hard for implement for me, at that moment. </p>
  
  <p>So my question is: is there any possiblity to edit binomial heap insertion algorithm to skip duplicates? Maybe anyoune could suggest another structure?</p>
  
  <p>Grettings :)</p>