52   BinaryTree<int>* mergeTree = new BinaryTree<int>;  in TEST_F()  local
53   BinaryTree<int>::iterator pos2 = mergeTree->root();  in TEST_F()
54   mergeTree->join<TreeIteratorBase::Rightward>(pos2, 1);  in TEST_F()
56   mergeTree->join<TreeIteratorBase::Rightward>(pos2, 1);  in TEST_F()
57   mergeTree->join<TreeIteratorBase::Leftward>(pos2, 1);  in TEST_F()
59   m_pTestee->merge<TreeIteratorBase::Rightward>(pos, *mergeTree);  in TEST_F()
60   delete mergeTree;  in TEST_F()
68   BinaryTree<int>* mergeTree = new BinaryTree<int>;  in TEST_F()  local
69   mergeTree->join<TreeIteratorBase::Rightward>(pos, 0);  in TEST_F()
71   mergeTree->join<TreeIteratorBase::Rightward>(pos, 1);  in TEST_F()
72   mergeTree->join<TreeIteratorBase::Leftward>(pos, 1);  in TEST_F()
74   mergeTree->join<TreeIteratorBase::Rightward>(pos, 2);  in TEST_F()
75   mergeTree->join<TreeIteratorBase::Leftward>(pos, 2);  in TEST_F()
77   m_pTestee->merge<TreeIteratorBase::Rightward>(pos, *mergeTree);  in TEST_F()
79   delete mergeTree;  in TEST_F()
93   BinaryTree<int>* mergeTree = new BinaryTree<int>;  in TEST_F()  local
94   BinaryTree<int>::iterator pos2 = mergeTree->root();  in TEST_F()
95   mergeTree->merge<TreeIteratorBase::Rightward>(pos2, *m_pTestee);  in TEST_F()
98   EXPECT_TRUE(mergeTree->size() == 5);  in TEST_F()
99   delete mergeTree;  in TEST_F()
105   BinaryTree<int>* mergeTree = new BinaryTree<int>;  in TEST_F()  local
106   BinaryTree<int>::iterator pos2 = mergeTree->root();  in TEST_F()
108   mergeTree->merge<TreeIteratorBase::Rightward>(pos2, *m_pTestee);  in TEST_F()
111   EXPECT_TRUE(mergeTree->size() == 0);  in TEST_F()
112   delete mergeTree;  in TEST_F()