title: Datastructure for fast and efficient search
body: <p>I have to store the <strong>sorted data in a data structure</strong>.
  The data structure I want to use is heap or binary search tree.
  But I am confused which one would better serve the requirement i.e. fast and efficient searching.</p>
  
  <p><strong>----MORE DETAILS---</strong></p>
  
  <p>I am designing an application that receive data from a source(say a data grid) and then store it into a data structure. The data that comes from data GRID station is in the form of sorted digits. The sorted data can be in ascending or descending order.</p>
  
  <p>now I have to search the data. and the process should be efficient and fast.</p>