building red-black tree by inserting 1000000 elements in ascending order (worst case)
time used: 1248 msec
t.size() = 1000000
t.depth() = 26
t.minDepth() = 19
t.inv() = true
mem stats for ds.persistent.map.RedBlackTree object:
# elements (size) : 1000000
# objects : 1000000
# fields : 5000000
# mem words : 6000000
stats for ds.persistent.map.RedBlackTree:
# new Node() : 29836411
# new Iterator() : 0
traversing all elements in tree 20 times
time used: 1933 msec
looking up all elements in tree 20 times
time used: 2519 msec
deleting a red-black tree by removing 1000000 elements in ascending order
time used: 661 msec
t.size() = 0
t.depth() = 0
t.minDepth() = 0
t.inv() = true
stats for ds.persistent.map.RedBlackTree:
# new Node() : 50668292
# new Iterator() : 80
