/* Function to traverse binary tree without recursion and
* without stack */
public void MorrisTraversal(tNode root)
{
tNode current, pre;
if (root == null)
{
return;
}
current = root;
while (current != null)
{
if (current.left == null)
{
Console.WriteLine(current.data + " ");
current = current.right;
}
else
{
/* Find the inorder predecessor of current */
pre = current.left;
while (pre.right != null && pre.right != current)
{
pre = pre.right;
}
/* Make current as right child of its inorder predecessor */
if (pre.right == null)
{
pre.right = current;
current = current.left;
}
/* Revert the changes made in if part to restore the
* original tree i.e.,fix the right child of predecssor*/
else
{
pre.right = null;
Console.WriteLine(current.data + " ");
current = current.right;
} /* End of if condition pre->right == NULL */
} /* End of if condition current->left == NULL*/
} /* End of while */
}
public tNode(int item)
{
data = item;
left = right = null;
}