BSTreeNode *ConvertNode(BSTreeNode *pNode,bool asRight)
{
if(!pNode)
{
return NULL;
}
BSTreeNode *pLeft = NULL;
BSTreeNode *pRight = NULL;
//如果左孩子不空,则递归转换左子树-->双向链表,并返回左子链表的最右端节点(最大值节点)
if(pNode->m_pLeft)
{
pLeft = ConvertNode(pNode->m_pLeft,false);
}
//将当前节点与左子链表的最右端连接起来。
if(pLeft)
{
pLeft->m_pRight = pNode;
pNode->m_pLeft = pLeft;
}
//如果右孩子不空,则递归转换右子树-->双向链表,并返回右子链表的最左端的节点(最小值节点)
if(pNode->m_pRight)
{
pRight = ConvertNode(pNode->m_pRight,true);
}
//把当前节点与右子链表上最左端节点连接起来。
if(pRight)
{
pNode->m_pRight = pRight;
pRight->m_pLeft = pNode;
}
//
BSTreeNode *pTemp = pNode;
//如果该分支是右子树,则将指针移动到最左侧
if(asRight)
{
while(pTemp->m_pLeft)
{
pTemp = pTemp->m_pLeft;
}
}
else//否则肯定是左子树,则移动指针到最右侧
{
while(pTemp->m_pRight)
{
pTemp = pTemp->m_pRight;
}
}
return pTemp;
}