>I guess I meant binary tree sort, not searching. But, once the tree is built, the data is sorted. Not sure how quickly the sorting is done, but each value is only touched once, so it should be fast.

It's pretty fast, I think, but is different in that you still have to go through the entire tree after building to strip off the data from the nodes if you want a sorted output...for a memory only sort, I believe trees are quite a bit faster *however* < s > ...

I built a binary tree in mainframe memory using pointers in PL/I some years ago. It was pretty fast, better than the I/O-type sorts like Quicksort. *But* when we saw the cost of the runs on the mainframe, it was like over $1000 each job for the memory usage with the tree sort, compared with about $20 for the slower I/O sort jobs :)