100     bfs_iterator it = bfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);  in bfs_begin()
107     return bfs_iterator(BinaryTreeBase<Input>::m_Root.node.right);  in bfs_end()
112         const_bfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);  in bfs_begin()
119     return const_bfs_iterator(BinaryTreeBase<Input>::m_Root.node.right);  in bfs_end()
123     dfs_iterator it = dfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);  in dfs_begin()
130     return dfs_iterator(BinaryTreeBase<Input>::m_Root.node.right);  in dfs_end()
135         const_dfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);  in dfs_begin()
142     return const_dfs_iterator(BinaryTreeBase<Input>::m_Root.node.right);  in dfs_end()
145   iterator root() { return iterator(&(BinaryTreeBase<Input>::m_Root.node)); }  in root()
151         const_cast<NodeBase*>(&BinaryTreeBase<Input>::m_Root.node));  in root()
155     iterator it = iterator(BinaryTreeBase<Input>::m_Root.node.left);  in begin()
159   iterator end() { return iterator(BinaryTreeBase<Input>::m_Root.node.right); }  in end()
162     return const_iterator(BinaryTreeBase<Input>::m_Root.node.left);  in begin()
166     return const_iterator(BinaryTreeBase<Input>::m_Root.node.right);  in end()
199       pPosition.hook<DIRECT>(pTree.m_Root.node.left);  in merge()
200       BinaryTreeBase<Input>::m_Root.summon(pTree.BinaryTreeBase<Input>::m_Root);  in merge()
201       BinaryTreeBase<Input>::m_Root.delegate(pTree.m_Root);  in merge()
202       pTree.m_Root.node.left = pTree.m_Root.node.right = &pTree.m_Root.node;  in merge()