public int getNth(TreeNode node, int n){
        if(node == null) return -1;
        int left = getNth(node.left, n);
        if(left != -1) return left;
        order++;
        if(order == n) return node.val;
        int right = getNth(node.right, n);
        return right;
    }