building binary heap tree by inserting 10 random elements)
insert 1985549546, 0
insert 1777463706, 1
insert -1789925308, 2
insert 911806620, 3
insert -996170585, 4
insert -266225418, 5
insert -2048686224, 6
insert -3041550, 7
insert -259876063, 8
insert -262368582, 9
time used: 2 msec
h.size() = 10
h.depth() = 5
h.minDepth() = 2
h.inv() = true
mem stats for ds.persistent.queue.BinaryHeap object:
# elements (size) : 10
# objects : 10
# fields : 40
# mem words : 50
stats for ds.persistent.queue.BinaryHeap:
# new Node() : 24
# new Iterator() : 0
deleting a binary heap tree by removing 10 elements in ascending order
remove -2048686224, 6
remove -1789925308, 2
remove -996170585, 4
remove -266225418, 5
remove -262368582, 9
remove -259876063, 8
remove -3041550, 7
remove 911806620, 3
remove 1777463706, 1
remove 1985549546, 0
binary heap: h.isEmpty() == true
time used: 0 msec
h.size() = 0
h.depth() = 0
h.minDepth() = 0
h.inv() = true
stats for ds.persistent.queue.BinaryHeap:
# new Node() : 34
# new Iterator() : 0
building binary heap tree by inserting 10 ascending elements
insert 0, 0
insert 1, 1
insert 2, 2
insert 3, 3
insert 4, 4
insert 5, 5
insert 6, 6
insert 7, 7
insert 8, 8
insert 9, 9
time used: 0 msec
h.size() = 10
h.depth() = 4
h.minDepth() = 3
h.inv() = true
mem stats for ds.persistent.queue.BinaryHeap object:
# elements (size) : 10
# objects : 10
# fields : 40
# mem words : 50
stats for ds.persistent.queue.BinaryHeap:
# new Node() : 63
# new Iterator() : 0
deleting a binary heap tree by removing 10 elements in ascending order
remove 0, 0
remove 1, 1
remove 2, 2
remove 3, 3
remove 4, 4
remove 5, 5
remove 6, 6
remove 7, 7
remove 8, 8
remove 9, 9
binary heap: h.isEmpty() == true
time used: 1 msec
h.size() = 0
h.depth() = 0
h.minDepth() = 0
h.inv() = true
stats for ds.persistent.queue.BinaryHeap:
# new Node() : 77
# new Iterator() : 0
building binary heap tree by inserting 10 descending elements
insert 9, 0
insert 8, 1
insert 7, 2
insert 6, 3
insert 5, 4
insert 4, 5
insert 3, 6
insert 2, 7
insert 1, 8
insert 0, 9
time used: 0 msec
h.size() = 10
h.depth() = 10
h.minDepth() = 1
h.inv() = true
mem stats for ds.persistent.queue.BinaryHeap object:
# elements (size) : 10
# objects : 10
# fields : 40
# mem words : 50
stats for ds.persistent.queue.BinaryHeap:
# new Node() : 96
# new Iterator() : 0
deleting a binary heap tree by removing 10 elements in ascending order
remove 0, 9
remove 1, 8
remove 2, 7
remove 3, 6
remove 4, 5
remove 5, 4
remove 6, 3
remove 7, 2
remove 8, 1
remove 9, 0
binary heap: h.isEmpty() == true
time used: 0 msec
h.size() = 0
h.depth() = 0
h.minDepth() = 0
h.inv() = true
stats for ds.persistent.queue.BinaryHeap:
# new Node() : 96
# new Iterator() : 0
building binary heap tree by inserting 10 times the same element
insert 0, 0
insert 0, 1
insert 0, 2
insert 0, 3
insert 0, 4
insert 0, 5
insert 0, 6
insert 0, 7
insert 0, 8
insert 0, 9
time used: 1 msec
h.size() = 10
h.depth() = 10
h.minDepth() = 1
h.inv() = true
mem stats for ds.persistent.queue.BinaryHeap object:
# elements (size) : 10
# objects : 10
# fields : 40
# mem words : 50
stats for ds.persistent.queue.BinaryHeap:
# new Node() : 115
# new Iterator() : 0
deleting a binary heap tree by removing 10 elements in ascending order
remove 0, 9
remove 0, 8
remove 0, 7
remove 0, 6
remove 0, 5
remove 0, 4
remove 0, 3
remove 0, 2
remove 0, 1
remove 0, 0
binary heap: h.isEmpty() == true
time used: 0 msec
h.size() = 0
h.depth() = 0
h.minDepth() = 0
h.inv() = true
stats for ds.persistent.queue.BinaryHeap:
# new Node() : 115
# new Iterator() : 0
