牛客网－Ｃ++剑指offer－第二十六题(二叉搜索树与双向链表)

题目描述

输入一棵二叉搜索树，将该二叉搜索树转换成一个排序的双向链表。要求不能创建任何新的结点，只能调整树中结点指针的指向。

 

解题思路:

二叉搜索树是排序树，见下图。想变成有序双向链表，只需要进行中序遍历，将每个节点链接起来。

 

参考代码:

#include <iostream>
#include <string.h>
#include <vector>
#include <stack>
#include <queue>
#include<algorithm>

using namespace std;

struct TreeNode {
	int val;
	struct TreeNode *left;
	struct TreeNode *right;
	TreeNode(int x) :
			val(x), left(NULL), right(NULL) {
	}
};
//上一个节点和本次节点进行链接构建
class Solution {
public:
    class Solution {
public:
	TreeNode* Convert(TreeNode* root)
	{
		if (root == NULL)
			return root;
		TreeNode* res = root;
		TreeNode* pre = root;
		TreeNode* back = NULL;
		stack<TreeNode*> my_stack;
        //先将res遍历到最左端，这个是转换后的头结点
		while (res->left)
		{
			res = res->left;
		}
        //中序遍历+前后双指针连接
		while (pre || !my_stack.empty())
		{
			while (pre)
			{
				my_stack.push(pre);
				pre = pre->left;
			}

			if (!my_stack.empty())
			{
				pre = my_stack.top();
				pre->left = back;
				if (back)
				{
					back->right = pre;
				}
				back = pre;
				my_stack.pop();
				pre = pre->right;
			}
		}
		return res;
	}
};


int main()
{
    Solution solution;

    TreeNode TreeNode1(1);
    TreeNode TreeNode2(2);
    TreeNode TreeNode3(3);
    TreeNode TreeNode4(4);
    TreeNode TreeNode5(5);
    TreeNode TreeNode6(6);
    TreeNode TreeNode7(7);

    TreeNode4.left = &TreeNode2;
    TreeNode4.right = &TreeNode6;
    TreeNode2.left = &TreeNode1;
    TreeNode2.right = &TreeNode3;
    TreeNode6.left = &TreeNode5;
    TreeNode6.right = &TreeNode7;

    TreeNode* my_res;
    my_res = solution.Convert(&TreeNode4);

    while (my_res)
    {
        cout<<my_res->val<<" ";
        my_res = my_res->right;
    }

    return 0;
}