Morris infix traverse for Binary tree using Java

public class Morris {
public static void main(String[] args){
Node root = create();
morrisInfix(root);
}

static final class Node{
Object value;
Node left;
Node right;

Node(Object value, Node left, Node right){
this.value = value;
this.left = left;
this.right = right;
}
}

public static void morrisInfix(Node root){
if(root == null){
return;
}
Node subRoot = root;
Node left;
while(subRoot != null){
left = subRoot.left;
if(left != null){
while(left.right != null && left.right != subRoot){
left = left.right;
}
if(left.right == null){
left.right = subRoot;
subRoot = subRoot.left;
continue;
}else{
left.right = null;
}

}
System.out.print(subRoot.value + ",");
subRoot = subRoot.right;
}
}


public static Node create(){
Node n1 = new Node(1,null,null);
Node n3 = new Node(3,null,null);
Node n2 = new Node(2,n1,n3);


Node n5 = new Node(5,null,null);
Node n7 = new Node(7,null,null);
Node n6 = new Node(6,n5,n7);

Node  root = new Node(4,n2,n6);
return root;
}
}