Lines Matching refs:left
35 m_Stack.push(m_pNode->left);
50 m_Stack.push(m_pNode->left);
65 m_Queue.push(m_pNode->left);
80 m_Queue.push(m_pNode->left);
261 // | |left |
264 // | Left Right |
275 TreeImpl() : NodeFactory<DataType>() { node.left = node.right = &node; }
287 if ((*data).left == &pClient.node)
288 (*data).left = &node;
304 result->left = result->right = &m_Root.node;
309 pNode->left = pNode->right = 0;
371 return bfs_iterator(BinaryTreeBase<DataType>::m_Root.node.left);
379 return const_bfs_iterator(BinaryTreeBase<DataType>::m_Root.node.left);
387 return dfs_iterator(BinaryTreeBase<DataType>::m_Root.node.left);
395 return const_dfs_iterator(BinaryTreeBase<DataType>::m_Root.node.left);
409 return iterator(BinaryTreeBase<DataType>::m_Root.node.left);
417 return const_iterator(BinaryTreeBase<DataType>::m_Root.node.left);
454 pPosition.hook<DIRECT>(pTree.m_Root.node.left);
458 pTree.m_Root.node.left = pTree.m_Root.node.right = &pTree.m_Root.node;
