|
B
|
Seboettg\Forest\AVLTree::rebalance()
|
0
|
13
|
7
|
7
|
0
|
0
|
0
|
|
A
|
BinaryTree::removeItemRecursive()
|
0
|
17
|
6
|
6.01
|
0
|
0
|
0
|
|
A
|
Seboettg\Forest\AVLTree::insertNode()
|
0
|
13
|
6
|
6.02
|
0
|
0
|
0
|
|
A
|
Forest\AVLTree::reassignSubtree()
|
0
|
18
|
5
|
5.14
|
0
|
0
|
0
|
|
A
|
Forest\BinaryTree::reassignSubtree()
|
0
|
17
|
5
|
5
|
0
|
0
|
0
|
|
A
|
TreeTraversalTrait::toArrayList()
|
0
|
14
|
5
|
5
|
1
|
0
|
1
|
|
A
|
Forest\Visitor\InOrderVisitor::visit()
|
0
|
12
|
5
|
5
|
1
|
0
|
1
|
|
A
|
Seboettg\Forest\BinaryTree::insert()
|
0
|
10
|
5
|
5.27
|
0
|
0
|
0
|
|
A
|
Seboettg\Forest\BinaryTree::remove()
|
0
|
10
|
5
|
5.27
|
0
|
0
|
0
|
|
A
|
Forest\BinaryTree::insertRecursive()
|
0
|
10
|
4
|
4
|
0
|
0
|
0
|
|
A
|
AddressBookEntry::compareTo()
|
0
|
1
|
1
|
?
|
0
|
0
|
0
|
|
A
|
Seboettg\Forest\GeneralTree::count()
|
0
|
1
|
1
|
1
|
0
|
0
|
0
|
|
A
|
Forest\BinaryTree\BinaryNode::accept()
|
0
|
1
|
1
|
1
|
0
|
0
|
0
|
|
A
|
Seboettg\Forest\BinaryTree::insertItem()
|
0
|
4
|
2
|
2
|
0
|
0
|
0
|
|
A
|
Forest\General\TreeNode::isRoot()
|
0
|
1
|
1
|
1
|
1
|
0
|
1
|
seboettg /
Forest
