In the traditional sense of the word traversal, I don't think you can do this. I believe the tree must first be sorted (for example with a heapsort) and then traversed.