title: Java Algorithm for finding the largest set of independent nodes in a binary tree
body: <p>By independent nodes, I mean that the returned set can not contain nodes that are in immediate relations, parent and child cannot both be included. I tried to use Google, with no success. I don't think I have the right search words. </p>
  
  <p>A link, any help would be very much appreciated. Just started on this now. </p>
  
  <p>I need to return the actual set of independent nodes, not just the amount. </p>