building binary search tree by inserting 1023 elements in ascending order (worst case)
time used: 58 msec
t.inv() = true
t.size() = 1023
t.depth() = 1023
t.minDepth() = 1
t.balanced() = false
mem stats for ds.persistent.map.BinaryTree object:
# elements (size) : 1023
# objects : 1023
# fields : 4092
# mem words : 5115
traversing all elements in tree 20 times
time used: 54 msec
looking up all elements in tree 20 times
time used: 90 msec
balance tree
time used: 0 msec
looking up all elements in tree 20 times
time used: 49 msec
t.inv() = true
t.size() = 1023
t.depth() = 10
t.minDepth() = 10
t.balanced() = true
removing all elements in ascending order
time used: 5 msec
t.inv() = true
t.size() = 0
t.depth() = 0
t.minDepth() = 0
t.balanced() = true
stats for ds.persistent.map.BinaryTree:
# new Node() : 528896
# new Iterator() : 61
