run red black trees with inserting 1000000 elements in ascending order
card(s) = 1000000
minPathLength(s) = 19
maxPathLength(s) = 26
runtime was 0.89 sec
run red black trees with inserting 2000000 elements in ascending order
card(s) = 2000000
minPathLength(s) = 20
maxPathLength(s) = 27
runtime was 1.92 sec
run red black trees with inserting 4000000 elements in ascending order
card(s) = 4000000
minPathLength(s) = 21
maxPathLength(s) = 28
runtime was 4.14 sec
run red black trees with inserting 8000000 elements in ascending order
card(s) = 8000000
minPathLength(s) = 22
maxPathLength(s) = 29
runtime was 8.97 sec
