|
C
|
DataStructures\Trees\TrieTree::delete()
|
0
|
31
|
11
|
0
|
0
|
0
|
|
C
|
Lists\SinglyLinkedList::delete()
|
4
|
27
|
8
|
0
|
0
|
0
|
|
C
|
Lists\DoublyLinkedList::search()
|
0
|
19
|
8
|
0
|
0
|
0
|
|
C
|
DataStructures\Trees\AVLTree::rebalance()
|
0
|
23
|
8
|
1
|
0
|
0
|
|
C
|
DataStructures\Trees\TrieTree::add()
|
0
|
21
|
7
|
0
|
0
|
0
|
|
C
|
DataStructures\Trees\TrieTree::contains()
|
0
|
18
|
7
|
0
|
0
|
0
|
|
C
|
DataStructures\Trees\BinaryTreeAbstract::put()
|
0
|
26
|
7
|
1
|
0
|
0
|
|
C
|
DataStructures\Lists\ListAbstract::delete()
|
0
|
14
|
7
|
0
|
0
|
0
|
|
B
|
DataStructures\Trees\AVLTree::maxHeight()
|
0
|
8
|
8
|
0
|
0
|
0
|
|
B
|
Lists\SinglyLinkedList::remove()
|
11
|
18
|
5
|
0
|
0
|
0
|
|
B
|
Lists\DoublyLinkedList::remove()
|
10
|
18
|
5
|
0
|
0
|
0
|
|
B
|
Lists\CircularLinkedList::remove()
|
11
|
19
|
5
|
0
|
0
|
0
|
|
B
|
Trees\BinaryTreeAbstract::_delete()
|
0
|
20
|
5
|
0
|
0
|
0
|
|
B
|
DataStructures\Trees\AVLTree::rightRotation()
|
0
|
16
|
4
|
4
|
1
|
1
|
|
B
|
DataStructures\Trees\AVLTree::leftRotation()
|
0
|
16
|
4
|
1
|
0
|
0
|