272     NodeBase node;
275     TreeImpl() : NodeFactory<DataType>() { node.left = node.right = &node; }  in TreeImpl()
287         if ((*data).left == &pClient.node)  in summon()
288           (*data).left = &node;  in summon()
289         if ((*data).right == &pClient.node)  in summon()
290           (*data).right = &node;  in summon()
304     result->left = result->right = &m_Root.node;  in createNode()
371     return bfs_iterator(BinaryTreeBase<DataType>::m_Root.node.left);  in bfs_begin()
375     return bfs_iterator(BinaryTreeBase<DataType>::m_Root.node.right);  in bfs_end()
379     return const_bfs_iterator(BinaryTreeBase<DataType>::m_Root.node.left);  in bfs_begin()
383     return const_bfs_iterator(BinaryTreeBase<DataType>::m_Root.node.right);  in bfs_end()
387     return dfs_iterator(BinaryTreeBase<DataType>::m_Root.node.left);  in dfs_begin()
391     return dfs_iterator(BinaryTreeBase<DataType>::m_Root.node.right);  in dfs_end()
395     return const_dfs_iterator(BinaryTreeBase<DataType>::m_Root.node.left);  in dfs_begin()
399     return const_dfs_iterator(BinaryTreeBase<DataType>::m_Root.node.right);  in dfs_end()
402   iterator root() { return iterator(&(BinaryTreeBase<DataType>::m_Root.node)); }  in root()
405     return const_iterator(&(BinaryTreeBase<DataType>::m_Root.node));  in root()
409     return iterator(BinaryTreeBase<DataType>::m_Root.node.left);  in begin()
413     return iterator(BinaryTreeBase<DataType>::m_Root.node.right);  in end()
417     return const_iterator(BinaryTreeBase<DataType>::m_Root.node.left);  in begin()
421     return const_iterator(BinaryTreeBase<DataType>::m_Root.node.right);  in end()
432     node_type* node = BinaryTreeBase<DataType>::createNode();  in join()  local
433     node->data = const_cast<DataType*>(&pValue);  in join()
436       pPosition.hook<TreeIteratorBase::Leftward>(node);  in join()
438       pPosition.hook<DIRECT>(node);  in join()
454       pPosition.hook<DIRECT>(pTree.m_Root.node.left);  in merge()
458       pTree.m_Root.node.left = pTree.m_Root.node.right = &pTree.m_Root.node;  in merge()