TBT - Threaded Binary Tree
In computing, a threaded binary tree is a binary tree variant that allows fast traversal: given a pointer to a node in a threaded tree, it is possible to cheaply find its in-order successor (and/or predecessor).
Below is an implementation of a TBT in C++ language.