building binary search tree by inserting 1023 random integers
(simple version by stepwise insertion)
time used: 51 msec
building binary search tree by inserting 1023 random integers
(with iterator)
time used: 44 msec
t.inv() = true
t.size() = 1023
t.depth() = 22
t.minDepth() = 5
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: 16 msec
looking up all elements in tree 20 times
time used: 11 msec
balance tree
time used: 0 msec
looking up all elements in tree 20 times
time used: 6 msec
t.inv() = true
t.size() = 1023
t.depth() = 10
t.minDepth() = 10
t.balanced() = true
removing all elements by stepwise removing the root element
time used: 2 msec
t.inv() = true
t.size() = 0
t.depth() = 0
t.minDepth() = 0
t.balanced() = true
stats for ds.persistent.map.BinaryTree:
# new Node() : 29555
# new Iterator() : 61