对二叉树和平衡树测试

 

package cn.itcast.shujujiegou.tree;

import java.util.Random;

/**
 * Created by likailong on 2016/9/28.
 * 自定义类必须实现Comparable
 */
public class TreeTest {
    public static void main(String [] args){
        BinarySearchTree<Integer> binarySearchTree=new BinarySearchTree<>();
        AVLTree<Integer>avlTree=new AVLTree<>();
        Random ran=new Random();
        for(int i=0;i<10000;i++){
            binarySearchTree.insert(i);
            avlTree.insert(i);
        }
        //binarySearchTree.printTree();
      Integer ss = binarySearchTree.findMin();
       Integer bb = binarySearchTree.findMax();
        Integer aa = avlTree.findMax();
        Integer cc=avlTree.findMin();
        System.out.println("-----------"+ss+"------"+bb+"---"+binarySearchTree.height());
        System.out.println("-----------"+aa+"-----"+cc+"------"+avlTree.height());
    }
}

对上面代码进行测试

发现使用平衡树的深度浅，递归不容易出问题

因此以后操作树用平衡树比较好，后面我将会分析红黑树