Introduction - If you have any usage issues, please Google them yourself
A binary tree with n nodes has
n+1 pointers that store NULL.
A threaded binary tree uses these
pointers (that store NULL) to hold
the address of predecessor and
successor nodes.
This helps in quick traversal of
tree nodes.