If I want to search for the nearest neighbour of an _exisiting_ node in libkdtree I currently have to do something like: nearest = kdtree.find_nearest(...); tmp = nearest; kdtree.erase( nearest ); found = kdtree.find_nearest(...); tree.insert( tmp ); return found; Is there a better method? g