I don't mean to be nitpicky, but couldn't you just use a slightly modified binary tree algorithm?<P>I mean, the idea behind threaded binary trees (and correct me if I'm wrong) is that traversal is ...

You could also have a bidirectional tree (every child has a pointer to its parent), which is a bit easier to construct than a threaded tree.