我正在尝试使用后缀表达式创建表达式树。这需要一个可以容纳树对象的堆栈。我创建了一个泛型堆栈类 <TreeTemp> 作为类型参数。
在尝试用下面的语句初始化堆栈时，给出“cannot inferse type arguments for treestack<>”错误。 private TreeStack<TreeTemp> stack1 = new TreeStack<>(new TreeTemp()); 堆栈类：

public class TreeStack<T> {

    private T [] stackElem;
    private final int MAXSTACKSIZE;
    private int top;

    public TreeStack(Class<T> t) {
        top = -1;
        MAXSTACKSIZE = 20;
        final T[] stackElem = (T[]) Array.newInstance(t, MAXSTACKSIZE);
        this.stackElem = stackElem;

    }

    public void push(T elem) throws Exception{
        if(isFull()) {
            stackElem[++top] = elem;
        }
        else
            throw new Exception("Stack is already Full");
    }

    public T pop() throws Exception {

        if(isEmpty()) {
            return stackElem[top--];
        }
        else

            throw new Exception("Stack is Empty");
    }

    public boolean isEmpty() {return top == -1;}

    public boolean isFull() {return top==MAXSTACKSIZE-1;}
}

类（具有创建树的方法的类）

public class PostFix {

    private String expression = new String("A*B+C");
    private char [] expElem = expression.toCharArray();
/*Error on below Statement*/

    private TreeStack<TreeTemp> stack1 = new TreeStack<>(new TreeTemp());

    public TreeTemp makeTree() throws Throwable {
        try {
        for(int i=0;i<expElem.length;i++) {
            ExpNode eNode = new ExpNode();
            eNode.setiData(expElem[i]);
            TreeTemp t = new TreeTemp();
            t.setRoot(eNode);
            if(!Character.isLetter(expElem[i])) {
                t.setLeftTree(stack1.pop());
                t.setRightTree(stack1.pop());   
                }
            stack1.push(t);
        }
        return stack1.pop();
        }catch (Exception e) {
            throw new Exception("Stack Error while creating a Tree", e);
        }
    }

    public static void main(String[] args) throws Throwable {
        PostFix pf = new PostFix();
        TreeTemp t = pf.makeTree();

    }

树类（要添加到堆栈中的类型）：

public class TreeTemp {

    private ExpNode root;
    private TreeTemp leftTree;
    private TreeTemp rightTree;

    /*public TreeTemp(ExpNode expNode) {
        root = expNode;

        }*/

    public TreeTemp getLeftTree() {
        return leftTree;
    }

    public void setLeftTree(TreeTemp leftTree) {
        this.leftTree = leftTree;
    }

    public TreeTemp getRightTree() {
        return rightTree;
    }

    public void setRightTree(TreeTemp rightTree) {
        this.rightTree = rightTree;
    }

    public ExpNode getRoot() {
        return root;
    }
    public void setRoot(ExpNode node) {
        this.root = node;
    }
}

有人能给点建议吗。