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