Iterative In-Order Tree Traversal

What is the output when the main method of the BSTTest class is executed?

public class BSTTest {
    static class Node {
        int val;
        Node left, right;
        Node(int val) { this.val = val; }
    }
    public static void main(String[] args) {
        Node root = new Node(10);
        root.left = new Node(5);
        root.right = new Node(15);
        root.left.left = new Node(2);
        root.left.right = new Node(7);
        java.util.Stack<Node> stack = new java.util.Stack<>();
        Node curr = root;
        StringBuilder sb = new StringBuilder();
        while(curr != null || !stack.isEmpty()) {
            while(curr != null) {
                stack.push(curr);
                curr = curr.left;
            }
            curr = stack.pop();
            sb.append(curr.val).append(" ");
            curr = curr.right;
        }
        System.out.println(sb.toString().trim());
    }
}