title: Tree storing multiple values per node
body: <p>I'm trying to find a way to create a binary tree where 3 doubles are stored in each node and another tree where 6 doubles are stored in each node.</p>
  
  <p>The problem I'm having is figuring out a way to implement find and insert methods (no need for  remove).</p>
  
  <p>Basically, my tree is holding x, y, z values and when I call find, I want it to return the node which contains x, y, and z values closest to those I am trying to find.</p>
  
  <p>How should I be approaching this problem and what are some ideas for a solution?</p>
  
  <p>Thanks!</p>