Function to traverse a binary tree without recursion and without stack
void MorrisTraversal ( tNode root ) { tNode current , pre ; if ( root == null ) return ; current = root ; while ( current != null ) { if ( current . left == null ) { System . out . print ( current . data + " ▁ " ) ; current = current . right ; } else {