building red-black tree by inserting 1048575 elements in ascending order (worst case)
time used: 2191 msec
t.size() = 1048575
t.depth() = 20
t.minDepth() = 20
t.inv() = true
mem stats for ds.persistent.map.RedBlackTree object:
# elements (size) : 1048575
# objects : 1048575
# fields : 5242875
# mem words : 6291450
stats for ds.persistent.map.RedBlackTree:
# new Node() : 31457260
# new Iterator() : 0
traversing all elements in tree 20 times
time used: 1175 msec
looking up all elements in tree 20 times
time used: 2586 msec
deleting a red-black tree by removing 1048575 elements in ascending order
time used: 647 msec
t.size() = 0
t.depth() = 0
t.minDepth() = 0
t.inv() = true
stats for ds.persistent.map.RedBlackTree:
# new Node() : 53477285
# new Iterator() : 80
