struct BinaryTreeNode{int m_data;BinaryTreeNode* m_LeftNode;BinaryTreeNode* m_RightNode;
};

BinaryTreeNode* TransTreeToList(BinaryTreeNode* pBinaryTree)
{if (pBinaryTree == NULL)return NULL;BinaryTreeNode *pLastNodeInList = NULL;TransTreeToList(pBinaryTree, &pLastNodeInList);    //pLastNodeInList指向双向链表的尾结点//找到链表的头结点BinaryTreeNode* pHeadNode = pLastNodeInList;if (pHeadNode == NULL)return;while (pHeadNode->m_LeftNode != NULL)pHeadNode = pHeadNode->m_LeftNode;
}

void TransTreeToList(BinaryTreeNode* pNode, BinaryTreeNode** pLastNodeInList)
{if (pNode == NULL)return;BinaryTreeNode* pCurrent = pNode;                                  //根节点//下面所有代码是采用中序遍历的递归方法，仅仅不同的只是每次递归都将pLastNodeInList放到链表的最左边。if (pCurrent->m_LeftNode != NULL)                                  //找到最左子树TransTreeToList(pCurrent->m_LeftNode, pLastNodeInList);//下面三行代码表示将pLastNodeInList加到最左边pCurrent->m_LeftNode = *pLastNodeInList;                      if (*pLastNodeInList != NULL)(*pLastNodeInList)->m_RightNode = pCurrent;                    //因为是双向链表，所以pLastNodeInList要向右指向当前结点*pLastNodeInList = pCurrent;                                       //再遍历根节点,此时*pLastNodeInList为根节点，也就是在没有遍历右子树之前最后的一个结点。if(pCurrent->m_RightNode != NULL)                                  //再遍历右子树TransTreeToList(pCurrent->m_RightNode,pLastNodeInList);
}

void TransTree2List(Tree *pTree)
{if( NULL == pTree )return ;TransTree2List(pTree->leftTree);Convert2List(pTree);TransTree2List(pTree->rightTree);
}Tree *pHead = NULL;
Tree *pIndex = NULL ;
void Convert2List(Tree *pTreeNode)
{pIndex = pTreeNode->leftTree ;if (NULL == pIndex)pHead = pTreeNode ;elsepIndex->rightTree = pTreeNode;pHead = pTreeNode ;
}