最好用JavaScript或Java实现。

我用Javascript实现了这个二元查找树生成器：

 function Tree(root,value){
    Tree.prototype.findMin=function(){
        var tmp=this;
        while (tmp.root!=null&&tmp.root.value>tmp.value){
            tmp=tmp.root;
        }
        if(tmp.root!=null)
        {
            return tmp.root.value;
        }else{
            return min;
        }
    }
    Tree.prototype.findMax=function(){
        var tmp=this;
        while (tmp.root!=null&&tmp.root.value<tmp.value){
            tmp=tmp.root;
        }
        if(tmp.root!=null)
        {
            return tmp.root.value;
        }else{
            return max;
        }
    }
    this.root=root;
    this.value=value;
    var leftValue=null;
    this.left=null;
    var rightValue=null;
    this.right=null;
    if(this.root==null)
    {
        leftValue=Math.floor(Math.random()*(this.value-min));
        rightValue=this.value+1+Math.floor(Math.random()*(max-this.value));
        this.left=new Tree(this,leftValue);
        this.right=new Tree(this,rightValue);
    }

    var mmin=this.findMin();
    leftValue=mmin+Math.floor(Math.random()*(this.value-mmin));
    if(leftValue>mmin)
        this.left=new Tree(this,leftValue);
    var mmax=this.findMax();
    rightValue=this.value+Math.floor(Math.random()*(mmax-this.value));
    if(rightValue>this.value)
        this.right=new Tree(this,rightValue);
}
var middle=10;
var min=0;
var max=middle*2;

console.info(new Tree(null,10))