Create binary tree

package binaryTree;
import java.util.*;

// Define the nodes of a binary tree 
class TreeNode {
    
    int val;
    TreeNode left;
    TreeNode right;

    public TreeNode(){
    

    }

    public TreeNode(int val){
    
        this.val = val;
    }
    public TreeNode(int val, TreeNode left, TreeNode right){
    
        this.val = val;
        this.left = left;
        this.right = right;
    }
}

public class CreatTree {
    
    public static void main(String[] args) {
    
        System.out.println(" Enter the node value of the tree ( Input -1 Then terminate )：");
        Scanner sc = new Scanner(System.in);
        LinkedList<Integer> list = new LinkedList<>();
        while(true){
    
            int temp = sc.nextInt();
            if(temp == -1){
    
                break;
            }else{
    
                list.addLast(temp);
            }
        }
        TreeNode root = create(list);
        List<Integer> tree = traverse(root);
        System.out.print(" Middle order traversal result :");
        System.out.println(tree);
    }

    //（ Recursive in order ） Create a binary tree 
    public static TreeNode create(LinkedList<Integer> list){
    
        if(list==null||list.size()==0){
    
            return null;
        }
        TreeNode node = null;
        int data = list.removeFirst();
        if(data!=0){
    
            node = new TreeNode(data);
            node.left = create(list);
            node.right = create(list);
        }
        return node;
    }

    // Non recursive middle order traversal 
    public static List<Integer> traverse(TreeNode root){
    
        List<Integer> list = new ArrayList<>();
        if(root == null){
    
            return list;
        }
        Deque<TreeNode> stack = new LinkedList<>();
        TreeNode cur = root;
        while(cur!=null||!stack.isEmpty()){
    
            if(cur!=null){
    
                stack.push(cur);
                cur = cur.left;
            }else{
    
                cur = stack.pop();
                list.add(cur.val);
                cur = cur.right;
            }
        }
        return list;
    }
}

Test cases ：