building binary search tree by inserting 5000 elements in ascending order (worst case)
time used: 398 msec
t.inv() = true
t.size() = 5000
t.depth() = 5000
t.minDepth() = 1
t.balanced() = false
mem stats for ds.persistent.map.BinaryTree object:
# elements (size) : 5000
# objects : 5000
# fields : 20000
# mem words : 25000
traversing all elements in tree 20 times
time used: 59 msec
looking up all elements in tree 20 times
time used: 1523 msec
balance tree
time used: 7 msec
looking up all elements in tree 20 times
time used: 80 msec
t.inv() = true
t.size() = 5000
t.depth() = 13
t.minDepth() = 12
t.balanced() = true
removing all elements in ascending order
time used: 19 msec
t.inv() = true
t.size() = 0
t.depth() = 0
t.minDepth() = 0
t.balanced() = true
stats for ds.persistent.map.BinaryTree:
# new Node() : 12534513
# new Iterator() : 61
