algorithms.tutorialhorizon.com
Single Threaded Binary Tree Complete Implementation | Algorithms
each node is threaded towards either the in-order predecessor or successor (left or right) means all right null pointers will point to inorder successor OR all left null pointers will point to inorder predecessor