building red-black tree by inserting 8191 elements in ascending order (worst case)
time used: 29 msec
t.size() = 8191
t.depth() = 13
t.minDepth() = 13
t.inv() = true
mem stats for ds.persistent.map.RedBlackTree object:
# elements (size) : 8191
# objects : 8191
# fields : 40955
# mem words : 49146
stats for ds.persistent.map.RedBlackTree:
# new Node() : 159731
# new Iterator() : 0
traversing all elements in tree 20 times
time used: 48 msec
looking up all elements in tree 20 times
time used: 37 msec
deleting a red-black tree by removing 8191 elements in ascending order
time used: 18 msec
t.size() = 0
t.depth() = 0
t.minDepth() = 0
t.inv() = true
stats for ds.persistent.map.RedBlackTree:
# new Node() : 274373
# new Iterator() : 80
