Lines Matching full:right
33 m_Stack.push(m_pNode->right);
42 m_pNode = m_pNode->right; // should be root
48 m_Stack.push(m_pNode->right);
63 m_Queue.push(m_pNode->right);
72 m_pNode = m_pNode->right; // should be root
78 m_Queue.push(m_pNode->right);
212 bool isRoot() const { return (m_pNode->right == m_pNode); }
264 // | Left Right |
275 TreeImpl() : NodeFactory<DataType>() { node.left = node.right = &node; }
289 if ((*data).right == &pClient.node)
290 (*data).right = &node;
304 result->left = result->right = &m_Root.node;
309 pNode->left = pNode->right = 0;
375 return bfs_iterator(BinaryTreeBase<DataType>::m_Root.node.right);
383 return const_bfs_iterator(BinaryTreeBase<DataType>::m_Root.node.right);
391 return dfs_iterator(BinaryTreeBase<DataType>::m_Root.node.right);
399 return const_dfs_iterator(BinaryTreeBase<DataType>::m_Root.node.right);
413 return iterator(BinaryTreeBase<DataType>::m_Root.node.right);
421 return const_iterator(BinaryTreeBase<DataType>::m_Root.node.right);
458 pTree.m_Root.node.left = pTree.m_Root.node.right = &pTree.m_Root.node;
