Lines Matching refs:right
37 m_Stack.push(m_pNode->right);
47 m_pNode = m_pNode->right; // should be root
53 m_Stack.push(m_pNode->right);
72 m_Queue.push(m_pNode->right);
82 m_pNode = m_pNode->right; // should be root
88 m_Queue.push(m_pNode->right);
222 { return (m_pNode->right == m_pNode); }
274 // | Left Right |
288 node.left = node.right = &node;
304 if ((*data).right == &pClient.node)
305 (*data).right = &node;
319 result->left = result->right = &m_Root.node;
324 pNode->left = pNode->right = 0;
394 { return bfs_iterator(BinaryTreeBase<DataType>::m_Root.node.right); }
400 { return const_bfs_iterator(BinaryTreeBase<DataType>::m_Root.node.right); }
406 { return dfs_iterator(BinaryTreeBase<DataType>::m_Root.node.right); }
412 { return const_dfs_iterator(BinaryTreeBase<DataType>::m_Root.node.right); }
424 { return iterator(BinaryTreeBase<DataType>::m_Root.node.right); }
430 { return const_iterator(BinaryTreeBase<DataType>::m_Root.node.right); }
466 pTree.m_Root.node.left = pTree.m_Root.node.right = &pTree.m_Root.node;
