title: Binary Tree using int array as key (Euclidean distances)?
body: <p>Have written a Binary Search Tree that stores data on ships, the key for the search is their acoustic signature. </p>
  
  <p>When searching the tree I want to return either a ship with the correct signature or the one with the closest match to the searched signature. (By seeing which ship has the closest Euclidean distance).</p>
  
  <p>The problem I am having is how to compare the signatures other than their actual numerical value. Which would then mean that any search performed would be sequential and not binary?</p>
  
  <p>Any ideas?</p>