面试题36：二叉搜索树与双向链表

最新推荐文章于 2022-05-13 21:54:01 发布

C_臻可爱呢

最新推荐文章于 2022-05-13 21:54:01 发布

阅读量75

点赞数 1

分类专栏： C++剑指Offer刷题集

本文链接：https://blog.csdn.net/qq_38994205/article/details/104683831

版权

C++剑指Offer刷题集专栏收录该内容

42 篇文章 0 订阅

订阅专栏

#include <iostream>
struct BinaryTreeNode
{
	int m_nValue;
	BinaryTreeNode* pLeft, * pRight;
	BinaryTreeNode(int _value) :m_nValue(_value), pLeft(nullptr), pRight(nullptr) {}
};

void ConvertNode(BinaryTreeNode* pNode, BinaryTreeNode* pLastNodeInlist)
{
	if (pNode == nullptr)return;
	BinaryTreeNode* pCurrent = pNode;
	if(pCurrent->pLeft!=nullptr)
		ConvertNode(pCurrent->pLeft, pLastNodeInlist);
	pCurrent->pLeft = pLastNodeInlist;//当前节点的左指针变前指针指向前一个节点
	if (pLastNodeInlist != nullptr)
		pLastNodeInlist->pRight = pCurrent;//如果前一个节点不为空，则前一个节点的右指针变后指针指向当前节点
	pLastNodeInlist = pCurrent;//移动到当前节点
	if (pCurrent->pRight != nullptr)
		ConvertNode(pNode->pRight, pLastNodeInlist);

}

BinaryTreeNode* Convert(BinaryTreeNode* pRoot)
{
	if (pRoot == nullptr)return nullptr;
	BinaryTreeNode* pLastNodeInlist = nullptr;
	ConvertNode(pRoot, pLastNodeInlist);//pLastNodeInlist最终为链表的最后一个节点
	while (pLastNodeInlist->pLeft)
		pLastNodeInlist = pLastNodeInlist->pLeft;
	BinaryTreeNode* head = pLastNodeInlist;
	return head;
}