Threaded binary tree and morris traversal

algorithm
c-plus-plus

#1

can anyone explain me threaded binary tree and how we can do inorder traversal with the help of this.(an example will we useful)
thanks in advance
reply soon please


#2

#3

pseudo code for inorder traversal
inorder(tree *sub)
if(sub!=null)
inorder(sub->left)
printf("%d",sub->value)
inorder(sub->right)