题解 | #二叉搜索树与双向链表#

/*
struct TreeNode {
	int val;
	struct TreeNode *left;
	struct TreeNode *right;
	TreeNode(int x) :
			val(x), left(NULL), right(NULL) {
	}
};*/
class Solution {
public:
	vector<TreeNode*> Tree;
	void InorderTraversal(TreeNode* root)
	{
		if(root==nullptr)
			return;
		InorderTraversal(root->left);
		Tree.push_back(root);
		InorderTraversal(root->right);
	}
    TreeNode* Convert(TreeNode* pRootOfTree) {
        if(pRootOfTree==nullptr)
			return pRootOfTree;
		InorderTraversal(pRootOfTree);
		for(int i=0;i<Tree.size()-1;i++)
		{
			Tree[i]->right=Tree[i+1];
			Tree[i+1]->left=Tree[i];
		}
		return Tree[0];
    }
};