Question

Explain threaded binary tree with example

Answer 1

Definition. A threaded binary tree defined as
follows: "A binary tree is threaded by
making all right child pointers that would
normally be null point to the inorder
successor of the node (if it exists), and all
left child pointers that would normally be
null point to the inorder predecessor of the
node."