21   m_pTestee = new BinaryTree<int>();  in BinTreeTest()
43   BinaryTree<int>::iterator pos = m_pTestee->root();  in TEST_F()
52   BinaryTree<int>* mergeTree = new BinaryTree<int>;  in TEST_F()
53   BinaryTree<int>::iterator pos2 = mergeTree->root();  in TEST_F()
66   BinaryTree<int>::iterator pos = m_pTestee->root();  in TEST_F()
68   BinaryTree<int>* mergeTree = new BinaryTree<int>;  in TEST_F()
84   BinaryTree<int>::iterator pos = m_pTestee->root();  in TEST_F()
93   BinaryTree<int>* mergeTree = new BinaryTree<int>;  in TEST_F()
94   BinaryTree<int>::iterator pos2 = mergeTree->root();  in TEST_F()
103   BinaryTree<int>::iterator pos = m_pTestee->root();  in TEST_F()
105   BinaryTree<int>* mergeTree = new BinaryTree<int>;  in TEST_F()
106   BinaryTree<int>::iterator pos2 = mergeTree->root();  in TEST_F()
117   BinaryTree<int>::iterator pos = m_pTestee->root();  in TEST_F()
127   BinaryTree<int>::dfs_iterator dfs_it = m_pTestee->dfs_begin();  in TEST_F()
128   BinaryTree<int>::dfs_iterator dfs_end = m_pTestee->dfs_end();  in TEST_F()
145   BinaryTree<int>::iterator pos = m_pTestee->root();  in TEST_F()
156   BinaryTree<int>::dfs_iterator dfs_it = m_pTestee->dfs_begin();  in TEST_F()
157   BinaryTree<int>::dfs_iterator dfs_end = m_pTestee->dfs_end();  in TEST_F()
173   BinaryTree<int>::iterator pos = m_pTestee->root();  in TEST_F()
175   BinaryTree<int>::dfs_iterator dfs_it = m_pTestee->dfs_begin();  in TEST_F()
176   BinaryTree<int>::dfs_iterator dfs_end = m_pTestee->dfs_end();  in TEST_F()
187   BinaryTree<int>::iterator pos = m_pTestee->root();  in TEST_F()
197   BinaryTree<int>::bfs_iterator bfs_it = m_pTestee->bfs_begin();  in TEST_F()
198   BinaryTree<int>::bfs_iterator bfs_end = m_pTestee->bfs_end();  in TEST_F()
217   BinaryTree<int>::iterator pos = m_pTestee->root();  in TEST_F()
228   BinaryTree<int>::bfs_iterator bfs_it = m_pTestee->bfs_begin();  in TEST_F()
229   BinaryTree<int>::bfs_iterator bfs_end = m_pTestee->bfs_end();  in TEST_F()
245   BinaryTree<int>::iterator pos = m_pTestee->root();  in TEST_F()
247   BinaryTree<int>::bfs_iterator bfs_it = m_pTestee->bfs_begin();  in TEST_F()
248   BinaryTree<int>::bfs_iterator bfs_end = m_pTestee->bfs_end();  in TEST_F()
259   BinaryTree<int>::iterator pos = m_pTestee->root();  in TEST_F()
271   BinaryTree<int>::iterator it = m_pTestee->begin();  in TEST_F()
272   BinaryTree<int>::iterator end = m_pTestee->end();  in TEST_F()