def assert_tree_equal_no_labels(self, expected_newick, observed_tree):
expected = Tree.get(data=expected_newick, schema='<STR_LIT>', rooting='<STR_LIT>')<EOL>def prep_tree(tree):<EOL><INDENT>for n in tree.internal_nodes(): <EOL><INDENT>n.label = None<EOL><DEDENT>if n.edge.length is None: n.edge.length=<NUM_LIT:0.0><EOL>tree = self.sort_tree(tree)<EOL><DEDENT>prep_tree(expected)<EOL>prep_tree(observed_tree)<EOL>self.assertEqual(str(self.sort_tree(expected)), str(self.sort_tree(observed_tree)))<EOL>
should include some tree ordering because ordering of children is not relevant, but eh for now