title: Dictionary implementation using Binary Trees
body: <p>I read at multiple locations that Binary Trees should be preffered over Hash Tables where memory is limited as  Binary Trees would keep the data in sorted order while Hash Tables won't. The tradeoff being Binary Trees would have a O(log n) lookup and insertion as compared to constant time insertion and lookup in case of hash tables. </p>
  
  <p>I was wondering if I choose Binary Trees to implement my Address Book(always sorted), what should the key look like? would value be the name and number pair?</p>