如何在没有递归的情况下通过对给定二叉树执行中序遍历来打印所有节点？

public static void inorderTraversal(Node root) {        if(root == null) {            return;        }
        Stack<Node> stack = new Stack<>();        Node cur = root;
        while(true) {            while(cur != null) {                stack.push(cur);                cur = cur.left;            }
            if(stack.empty()) {                break;            }            Node top = stack.pop();   // 打印当前节点值            System.out.print(top.val + " ");            cur = top.right;        }    }