平衡二叉排序树对比红黑树

import redblacktree
import AVLTree
import random
import time
A = random.sample(range(10000000),9900000)
rbtree = A.copy()
start = time.time()
rb = redblacktree.RBT()
for key in rbtree:
    rb.INSERT(key)    
end = time.time()
print("redblack插入",end - start)
avltree = A.copy()
start = time.time()	 
avl_root = None
for key in avltree:
    avl_root = AVLTree.insert(avl_root, key)    
end = time.time()
print("AVLtree插入",end - start)
B = random.sample(range(10000000),9900000)
start = time.time()
for key in B:
    rb.DELETE(key)    
end = time.time()
print("redblack删除",end - start)
start = time.time()
for key in B:
    AVLTree.delete(avl_root,key)    
end = time.time()
print("AVLtree删除",end - start)

九十万数据：
redblack插入 22.656999826431274
AVLtree插入 30.627000093460083
redblack删除 18.52500009536743
AVLtree删除 25.805999755859375
九万数据：
redblack插入 1.0950000286102295
AVLtree插入 2.3320000171661377
redblack删除 0.9130001068115234
AVLtree删除 2.128000020980835
#9900000
redblack插入 394.25600004196167
AVLtree插入 490.7349998950958
redblack删除 336.0699999332428
AVLtree删除 351.5130000114441