23 	m_pTestee = new BinaryTree<int>();  in BinTreeTest()
50   BinaryTree<int>::iterator pos = m_pTestee->root();  in TEST_F()
59   BinaryTree<int> *mergeTree = new BinaryTree<int>;  in TEST_F()
60   BinaryTree<int>::iterator pos2 = mergeTree->root();  in TEST_F()
74   BinaryTree<int>::iterator pos = m_pTestee->root();  in TEST_F()
76   BinaryTree<int> *mergeTree = new BinaryTree<int>;  in TEST_F()
93   BinaryTree<int>::iterator pos = m_pTestee->root();  in TEST_F()
102   BinaryTree<int> *mergeTree = new BinaryTree<int>;  in TEST_F()
103   BinaryTree<int>::iterator pos2 = mergeTree->root();  in TEST_F()
113   BinaryTree<int>::iterator pos = m_pTestee->root();  in TEST_F()
115   BinaryTree<int> *mergeTree = new BinaryTree<int>;  in TEST_F()
116   BinaryTree<int>::iterator pos2 = mergeTree->root();  in TEST_F()
128   BinaryTree<int>::iterator pos = m_pTestee->root();  in TEST_F()
138   BinaryTree<int>::dfs_iterator dfs_it = m_pTestee->dfs_begin();  in TEST_F()
139   BinaryTree<int>::dfs_iterator dfs_end = m_pTestee->dfs_end();  in TEST_F()
157   BinaryTree<int>::iterator pos = m_pTestee->root();  in TEST_F()
168   BinaryTree<int>::dfs_iterator dfs_it = m_pTestee->dfs_begin();  in TEST_F()
169   BinaryTree<int>::dfs_iterator dfs_end = m_pTestee->dfs_end();  in TEST_F()
187   BinaryTree<int>::iterator pos = m_pTestee->root();  in TEST_F()
189   BinaryTree<int>::dfs_iterator dfs_it = m_pTestee->dfs_begin();  in TEST_F()
190   BinaryTree<int>::dfs_iterator dfs_end = m_pTestee->dfs_end();  in TEST_F()
202   BinaryTree<int>::iterator pos = m_pTestee->root();  in TEST_F()
212   BinaryTree<int>::bfs_iterator bfs_it = m_pTestee->bfs_begin();  in TEST_F()
213   BinaryTree<int>::bfs_iterator bfs_end = m_pTestee->bfs_end();  in TEST_F()
233   BinaryTree<int>::iterator pos = m_pTestee->root();  in TEST_F()
244   BinaryTree<int>::bfs_iterator bfs_it = m_pTestee->bfs_begin();  in TEST_F()
245   BinaryTree<int>::bfs_iterator bfs_end = m_pTestee->bfs_end();  in TEST_F()
263   BinaryTree<int>::iterator pos = m_pTestee->root();  in TEST_F()
265   BinaryTree<int>::bfs_iterator bfs_it = m_pTestee->bfs_begin();  in TEST_F()
266   BinaryTree<int>::bfs_iterator bfs_end = m_pTestee->bfs_end();  in TEST_F()
278   BinaryTree<int>::iterator pos = m_pTestee->root();  in TEST_F()
290   BinaryTree<int>::iterator it = m_pTestee->begin();  in TEST_F()
291   BinaryTree<int>::iterator end = m_pTestee->end();  in TEST_F()