二叉查找树数组的实现

private Object[] contents;
    private int count;
    
    public ArrayBinarySearchTree(Object root)
    {
        //Object[] contents = new Object[10];  悲剧啊！！！！局部变量覆盖了类成员变量
        contents = new Object[10];
        contents[0] = root;
        count = 1;
    }
    
    public void expand()
    {
        //Object[] larger = new Object[size()*3]; 
        Object[] larger = new Object[contents.length*3];
        for(int i = 0;i < contents.length;i++)
            larger[i] = contents[i];
        contents = larger;
    }