| containsSubclass(Class) |  | 0% | | 0% | 4 | 4 | 7 | 7 | 1 | 1 |
| collectAll(Predicate, List) | | 0% | | 0% | 3 | 3 | 6 | 6 | 1 | 1 |
| numNodes() | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| foreach(TreeNode.ThrowingConsumer) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| removeNode(int) | | 0% | | 0% | 4 | 4 | 3 | 3 | 1 | 1 |
| addChildren(List) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| findFirstOf(Class) |  | 86% | | 66% | 2 | 4 | 2 | 8 | 0 | 1 |
| anyMatch(Predicate) | | 84% | | 66% | 2 | 4 | 2 | 7 | 0 | 1 |
| clearChildren() | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| contains(List, Class) | | 89% | | 75% | 1 | 3 | 1 | 5 | 0 | 1 |
| contains(Class) | | 100% | | 87% | 1 | 5 | 0 | 7 | 0 | 1 |
| collect(Predicate, Collection) | | 100% | | 100% | 0 | 4 | 0 | 7 | 0 | 1 |
| collect(Class, Collection) | | 100% | | 100% | 0 | 3 | 0 | 7 | 0 | 1 |
| contains(Predicate) | | 100% | | 100% | 0 | 4 | 0 | 7 | 0 | 1 |
| foreachDown(Predicate) | | 100% | | 100% | 0 | 3 | 0 | 6 | 0 | 1 |
| contains(Collection, Predicate) | | 100% | | 100% | 0 | 3 | 0 | 5 | 0 | 1 |
| collect(Collection, Predicate, Collection) | | 100% | | 100% | 0 | 2 | 0 | 4 | 0 | 1 |
| collect(Collection, Class, Collection) | | 100% | | 100% | 0 | 2 | 0 | 4 | 0 | 1 |
| getChild(int) | | 100% | | 100% | 0 | 2 | 0 | 1 | 0 | 1 |
| hasChild(int) | | 100% | | 100% | 0 | 2 | 0 | 1 | 0 | 1 |
| TreeNode() | | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| setChild(int, TreeNode) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| addChild(TreeNode) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| getChildren() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |