Add threading to Binary Search Tree

[Rangerbob86]

Is there any easy way to implement threading to an already functional binary search tree? Or does the entire thing have to be rebuilt. I'm new to the threading concept, and am sort of unsure how to go about doing this. Thanks for any help!

[Fou-Lu]

Are you referring to multithread or threaded? The latter yould require modification to the code to point children with no children back to their parent, and is only useful in complete traversals. The former seems illogical since searching a bst only ever has one path to follow, so I cannot see a benefit from threading it. I could see the benefit of a multithread to a graph for calculating the shortest path, but that would be tough to control.