building binary heap tree by inserting 1000000 random elements)
time used: 867 msec
h.size() = 1000000
h.depth() = 48
h.minDepth() = 8
h.inv() = true
mem stats for ds.destructive.queue.BinaryHeap object:
# elements (size) : 1000000
# objects : 1000000
# fields : 4000000
# mem words : 5000000
stats for ds.destructive.queue.BinaryHeap:
# new Node() : 1000000
# new Iterator() : 0
deleting a binary heap tree by removing 1000000 elements with removeMin
binary heap: h.isEmpty() == true
time used: 1277 msec
h.size() = 0
h.depth() = 0
h.minDepth() = 0
h.inv() = true
stats for ds.destructive.queue.BinaryHeap:
# new Node() : 1000000
# new Iterator() : 0
building binary heap tree by inserting 1000000 ascending elements
time used: 1441 msec
h.size() = 1000000
h.depth() = 20
h.minDepth() = 19
h.inv() = true
mem stats for ds.destructive.queue.BinaryHeap object:
# elements (size) : 1000000
# objects : 1000000
# fields : 4000000
# mem words : 5000000
stats for ds.destructive.queue.BinaryHeap:
# new Node() : 2000000
# new Iterator() : 0
deleting a binary heap tree by removing 1000000 elements with removeMin
binary heap: h.isEmpty() == true
time used: 1347 msec
h.size() = 0
h.depth() = 0
h.minDepth() = 0
h.inv() = true
stats for ds.destructive.queue.BinaryHeap:
# new Node() : 2000000
# new Iterator() : 0
building binary heap tree by inserting 1000000 descending elements
time used: 386 msec
h.size() = 1000000
h.depth() = 1000000
h.minDepth() = 1
h.inv() = true
mem stats for ds.destructive.queue.BinaryHeap object:
# elements (size) : 1000000
# objects : 1000000
# fields : 4000000
# mem words : 5000000
stats for ds.destructive.queue.BinaryHeap:
# new Node() : 3000000
# new Iterator() : 0
deleting a binary heap tree by removing 1000000 elements with removeMin
binary heap: h.isEmpty() == true
time used: 12 msec
h.size() = 0
h.depth() = 0
h.minDepth() = 0
h.inv() = true
stats for ds.destructive.queue.BinaryHeap:
# new Node() : 3000000
# new Iterator() : 0
building binary heap tree by inserting 1000000 times the same element
time used: 376 msec
h.size() = 1000000
h.depth() = 1000000
h.minDepth() = 1
h.inv() = true
mem stats for ds.destructive.queue.BinaryHeap object:
# elements (size) : 1000000
# objects : 1000000
# fields : 4000000
# mem words : 5000000
stats for ds.destructive.queue.BinaryHeap:
# new Node() : 4000000
# new Iterator() : 0
deleting a binary heap tree by removing 1000000 elements with removeMin
binary heap: h.isEmpty() == true
time used: 14 msec
h.size() = 0
h.depth() = 0
h.minDepth() = 0
h.inv() = true
stats for ds.destructive.queue.BinaryHeap:
# new Node() : 4000000
# new Iterator() : 0
