二叉树转为双向链表

代码：

/*
struct TreeNode {
	int val;
	struct TreeNode *left;
	struct TreeNode *right;
	TreeNode(int x) :
			val(x), left(NULL), right(NULL) {
	}
};*/
class Solution {
public:
    TreeNode* Convert(TreeNode* root)
    {
        if(root==NULL)  return NULL;//递归边界
        if(root->left==NULL && root->right==NULL)  return root;//递归边界
        
        TreeNode* left = Convert(root->left);//递归左边
        TreeNode* p = left;
        while(p!=NULL && p->right!=NULL)//找左子树最右节点
            p = p->right;//当p->right为NULL的时候跳出循环
        if(left)//若左子树不空
        {
            p->right = root;
            root->left = p;
        }
        TreeNode* right = Convert(root->right);//递归右边
        if(right)//若右子树不空
        {
            root->right = right;
            right->left = root;
        }
        return left ? left : root;
    }
};

转载自：https://blog.csdn.net/m0_38024592/article/details/80669725