Home | History | Annotate | Download | only in ADT

Lines Matching refs:BinaryTreeBase

256 /** \class BinaryTreeBase
257  *  \brief BinaryTreeBase gives root node and memory management.
259  *  The memory management of nodes in is hidden by BinaryTreeBase.
260  *  BinaryTreeBase also provides the basic functions for merging a tree and
266 class BinaryTreeBase : private Uncopyable
333   BinaryTreeBase()
337   virtual ~BinaryTreeBase()
360 class BinaryTree : public BinaryTreeBase<DataType>
386   : BinaryTreeBase<DataType>()
394   { return bfs_iterator(BinaryTreeBase<DataType>::m_Root.node.left); }
397   { return bfs_iterator(BinaryTreeBase<DataType>::m_Root.node.right); }
400   { return const_bfs_iterator(BinaryTreeBase<DataType>::m_Root.node.left); }
403   { return const_bfs_iterator(BinaryTreeBase<DataType>::m_Root.node.right); }
406   { return dfs_iterator(BinaryTreeBase<DataType>::m_Root.node.left); }
409   { return dfs_iterator(BinaryTreeBase<DataType>::m_Root.node.right); }
412   { return const_dfs_iterator(BinaryTreeBase<DataType>::m_Root.node.left); }
415   { return const_dfs_iterator(BinaryTreeBase<DataType>::m_Root.node.right); }
418   { return iterator(&(BinaryTreeBase<DataType>::m_Root.node)); }
421   { return const_iterator(&(BinaryTreeBase<DataType>::m_Root.node)); }
424   { return iterator(BinaryTreeBase<DataType>::m_Root.node.left); }
427   { return iterator(BinaryTreeBase<DataType>::m_Root.node.right); }
430   { return const_iterator(BinaryTreeBase<DataType>::m_Root.node.left); }
433   { return const_iterator(BinaryTreeBase<DataType>::m_Root.node.right); }
443     node_type *node = BinaryTreeBase<DataType>::createNode();
467       BinaryTreeBase<DataType>::m_Root.summon(
468                                    pTree.BinaryTreeBase<DataType>::m_Root);
469       BinaryTreeBase<DataType>::m_Root.delegate(pTree.m_Root);