Lines Matching refs:right
40 m_Stack.push(m_pNode->right);
50 m_pNode = m_pNode->right; // should be root
56 m_Stack.push(m_pNode->right);
75 m_Queue.push(m_pNode->right);
85 m_pNode = m_pNode->right; // should be root
91 m_Queue.push(m_pNode->right);
225 { return (m_pNode->right == m_pNode); }
277 // | Left Right |
291 node.left = node.right = &node;
307 if ((*data).right == &pClient.node)
308 (*data).right = &node;
322 result->left = result->right = &m_Root.node;
327 pNode->left = pNode->right = 0;
397 { return bfs_iterator(BinaryTreeBase<DataType>::m_Root.node.right); }
403 { return const_bfs_iterator(BinaryTreeBase<DataType>::m_Root.node.right); }
409 { return dfs_iterator(BinaryTreeBase<DataType>::m_Root.node.right); }
415 { return const_dfs_iterator(BinaryTreeBase<DataType>::m_Root.node.right); }
427 { return iterator(BinaryTreeBase<DataType>::m_Root.node.right); }
433 { return const_iterator(BinaryTreeBase<DataType>::m_Root.node.right); }
470 pTree.m_Root.node.left = pTree.m_Root.node.right = &pTree.m_Root.node;
