building red-black tree by inserting 1023 elements in ascending order (worst case)
time used: 14 msec
t.size() = 1023
t.depth() = 10
t.minDepth() = 10
t.inv() = true
mem stats for ds.persistent.map.RedBlackTree object:
# elements (size) : 1023
# objects : 1023
# fields : 5115
# mem words : 6138
stats for ds.persistent.map.RedBlackTree:
# new Node() : 15350
# new Iterator() : 0
traversing all elements in tree 20 times
time used: 14 msec
looking up all elements in tree 20 times
time used: 9 msec
deleting a red-black tree by removing 1023 elements in ascending order
time used: 3 msec
t.size() = 0
t.depth() = 0
t.minDepth() = 0
t.inv() = true
stats for ds.persistent.map.RedBlackTree:
# new Node() : 26578
# new Iterator() : 80
