21   m_pTestee = new BinaryTree<int>();  in BinTreeTest()
26   delete m_pTestee;  in ~BinTreeTest()
43   BinaryTree<int>::iterator pos = m_pTestee->root();  in TEST_F()
44   m_pTestee->join<TreeIteratorBase::Rightward>(pos, 0);  in TEST_F()
46   m_pTestee->join<TreeIteratorBase::Rightward>(pos, 1);  in TEST_F()
47   m_pTestee->join<TreeIteratorBase::Leftward>(pos, 1);  in TEST_F()
49   m_pTestee->join<TreeIteratorBase::Rightward>(pos, 2);  in TEST_F()
50   m_pTestee->join<TreeIteratorBase::Leftward>(pos, 2);  in TEST_F()
59   m_pTestee->merge<TreeIteratorBase::Rightward>(pos, *mergeTree);  in TEST_F()
61   EXPECT_TRUE(m_pTestee->size() == 8);  in TEST_F()
66   BinaryTree<int>::iterator pos = m_pTestee->root();  in TEST_F()
77   m_pTestee->merge<TreeIteratorBase::Rightward>(pos, *mergeTree);  in TEST_F()
80   EXPECT_TRUE(m_pTestee->size() == 5);  in TEST_F()
84   BinaryTree<int>::iterator pos = m_pTestee->root();  in TEST_F()
85   m_pTestee->join<TreeIteratorBase::Rightward>(pos, 0);  in TEST_F()
87   m_pTestee->join<TreeIteratorBase::Rightward>(pos, 1);  in TEST_F()
88   m_pTestee->join<TreeIteratorBase::Leftward>(pos, 1);  in TEST_F()
90   m_pTestee->join<TreeIteratorBase::Rightward>(pos, 2);  in TEST_F()
91   m_pTestee->join<TreeIteratorBase::Leftward>(pos, 2);  in TEST_F()
95   mergeTree->merge<TreeIteratorBase::Rightward>(pos2, *m_pTestee);  in TEST_F()
103   BinaryTree<int>::iterator pos = m_pTestee->root();  in TEST_F()
108   mergeTree->merge<TreeIteratorBase::Rightward>(pos2, *m_pTestee);  in TEST_F()
117   BinaryTree<int>::iterator pos = m_pTestee->root();  in TEST_F()
119   m_pTestee->join<InputTree::Inclusive>(pos, a);  in TEST_F()
121   m_pTestee->join<InputTree::Positional>(pos, b);  in TEST_F()
122   m_pTestee->join<InputTree::Inclusive>(pos, c);  in TEST_F()
124   m_pTestee->join<InputTree::Positional>(pos, d);  in TEST_F()
125   m_pTestee->join<InputTree::Inclusive>(pos, e);  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()
146   m_pTestee->join<InputTree::Inclusive>(pos, a);  in TEST_F()
148   m_pTestee->join<InputTree::Positional>(pos, b);  in TEST_F()
150   m_pTestee->join<InputTree::Positional>(pos, c);  in TEST_F()
152   m_pTestee->join<InputTree::Positional>(pos, d);  in TEST_F()
154   m_pTestee->join<InputTree::Positional>(pos, e);  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()
174   m_pTestee->join<InputTree::Inclusive>(pos, 0);  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()
189   m_pTestee->join<InputTree::Inclusive>(pos, a);  in TEST_F()
191   m_pTestee->join<InputTree::Positional>(pos, b);  in TEST_F()
192   m_pTestee->join<InputTree::Inclusive>(pos, c);  in TEST_F()
194   m_pTestee->join<InputTree::Positional>(pos, d);  in TEST_F()
195   m_pTestee->join<InputTree::Inclusive>(pos, e);  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()
211   bfs_it = m_pTestee->bfs_begin();  in TEST_F()
212   bfs_end = m_pTestee->bfs_end();  in TEST_F()
217   BinaryTree<int>::iterator pos = m_pTestee->root();  in TEST_F()
218   m_pTestee->join<InputTree::Inclusive>(pos, a);  in TEST_F()
220   m_pTestee->join<InputTree::Positional>(pos, b);  in TEST_F()
222   m_pTestee->join<InputTree::Positional>(pos, c);  in TEST_F()
224   m_pTestee->join<InputTree::Positional>(pos, d);  in TEST_F()
226   m_pTestee->join<InputTree::Positional>(pos, e);  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()
246   m_pTestee->join<InputTree::Inclusive>(pos, 0);  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()
260   m_pTestee->join<InputTree::Inclusive>(pos, a);  in TEST_F()
262   m_pTestee->join<InputTree::Positional>(pos, b);  in TEST_F()
264   m_pTestee->join<InputTree::Inclusive>(pos, c);  in TEST_F()
265   m_pTestee->join<InputTree::Positional>(pos, f);  in TEST_F()
267   m_pTestee->join<InputTree::Positional>(pos, d);  in TEST_F()
269   m_pTestee->join<InputTree::Positional>(pos, e);  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()
286   it = m_pTestee->begin();  in TEST_F()