building binary search tree by inserting 10000 elements in ascending order (worst case)
time used: 1315 msec
t.inv() = true
t.size() = 10000
t.depth() = 10000
t.minDepth() = 1
t.balanced() = false
mem stats for ds.persistent.map.BinaryTree object:
# elements (size) : 10000
# objects : 10000
# fields : 40000
# mem words : 50000
traversing all elements in tree 20 times
time used: 67 msec
looking up all elements in tree 20 times
time used: 6065 msec
balance tree
time used: 12 msec
looking up all elements in tree 20 times
time used: 90 msec
t.inv() = true
t.size() = 10000
t.depth() = 14
t.minDepth() = 13
t.balanced() = true
removing all elements in ascending order
time used: 15 msec
t.inv() = true
t.size() = 0
t.depth() = 0
t.minDepth() = 0
t.balanced() = true
stats for ds.persistent.map.BinaryTree:
# new Node() : 50074018
# new Iterator() : 61
