building binary search tree by inserting 1000000 random integers
(simple version by stepwise insertion)
time used: 4003 msec
building binary search tree by inserting 1000000 random integers
(with iterator)
time used: 4833 msec
t.inv() = true
t.size() = 999882
t.depth() = 54
t.minDepth() = 8
t.balanced() = false
mem stats for ds.persistent.map.BinaryTree object:
# elements (size) : 999882
# objects : 999882
# fields : 3999528
# mem words : 4999410
traversing all elements in tree 20 times
time used: 1811 msec
looking up all elements in tree 20 times
time used: 4763 msec
balance tree
time used: 204 msec
looking up all elements in tree 20 times
time used: 3745 msec
t.inv() = true
t.size() = 999882
t.depth() = 20
t.minDepth() = 19
t.balanced() = true
removing all elements by stepwise removing the root element
time used: 280 msec
t.inv() = true
t.size() = 0
t.depth() = 0
t.minDepth() = 0
t.balanced() = true
stats for ds.persistent.map.BinaryTree:
# new Node() : 61766540
# new Iterator() : 61
