DefaultTreeNodeTest

Element	Missed Instructions	Cov.	Missed Branches	Cov.	Missed	Cxty	Missed	Lines	Missed	Methods
Total	2,255 of 2,255	0%	10 of 10	0%	36	36	348	348	31	31
testStructureAThreeNodeSwapped()		0%		n/a	1	1	43	43	1	1
testDfsBottommost()		0%		n/a	1	1	25	25	1	1
testPathToRoot()		0%		n/a	1	1	16	16	1	1
testWalkDfs()		0%		n/a	1	1	15	15	1	1
testDfs()		0%		n/a	1	1	18	18	1	1
testBfs()		0%		n/a	1	1	18	18	1	1
testForEachParent()		0%		n/a	1	1	20	20	1	1
testWalkBfs()		0%		n/a	1	1	13	13	1	1
testStructureLinearThreeNodeSwapped()		0%		n/a	1	1	19	19	1	1
testRemoveChildViaPredicate()		0%		n/a	1	1	21	21	1	1
assertTreeProperties(DefaultTreeNodeTest.Node)		0%		n/a	1	1	15	15	1	1
testRemoveChildDirectly()		0%		n/a	1	1	16	16	1	1
testSimpleTwoNodeTreeSwapped()		0%		n/a	1	1	18	18	1	1
testSimpleTwoNodeTree()		0%		n/a	1	1	17	17	1	1
testRemoveChild()		0%		n/a	1	1	13	13	1	1
testChangeId()		0%		n/a	1	1	13	13	1	1
testSingleNodeTree()		0%		n/a	1	1	11	11	1	1
assertNodeProperty(DefaultTreeNodeTest.Node, String, Object)		0%		0%	2	2	6	6	1	1
assertEdgeProperty(DefaultTreeNodeTest.Node, String, Object)		0%		0%	2	2	6	6	1	1
DefaultTreeNodeTest()		0%		n/a	1	1	5	5	1	1
testToStringStackOverflow()		0%		n/a	1	1	4	4	1	1
lambda$testBfs$8(List, DefaultTreeNodeTest.Node, DefaultTreeNodeTest.Node)		0%		0%	2	2	2	2	1	1
lambda$testDfsBottommost$5(List, DefaultTreeNodeTest.Node, DefaultTreeNodeTest.Node)		0%		0%	2	2	2	2	1	1
lambda$testDfs$3(List, DefaultTreeNodeTest.Node, DefaultTreeNodeTest.Node)		0%		0%	2	2	2	2	1	1
lambda$testDfsBottommost$6(List, DefaultTreeNodeTest.Node)		0%		n/a	1	1	2	2	1	1
static {...}		0%		n/a	1	1	2	2	1	1
lambda$testBfs$7(List, DefaultTreeNodeTest.Node)		0%		n/a	1	1	2	2	1	1
lambda$testDfsBottommost$4(List, DefaultTreeNodeTest.Node)		0%		n/a	1	1	2	2	1	1
lambda$testDfs$2(List, DefaultTreeNodeTest.Node)		0%		n/a	1	1	2	2	1	1
lambda$testRemoveChildViaPredicate$0(DefaultTreeNodeTest.Node)		0%		n/a	1	1	1	1	1	1
lambda$testRemoveChildViaPredicate$1(DefaultTreeNodeTest.Node)		0%		n/a	1	1	1	1	1	1