P>I'm working on a lab required use of a threaded binary tree. This is a tree wherein, if the left or right node is empty, it points to the node's inorder predecessor or sucessor, respectively.< ...

I'm working on my little library here, and in the data structures section I'm going to include a binary search and/or AVL tree, optionally supporting a multi-threaded environment. This is ...