将二叉树转成单链表(c++&&goalng)

struct TreeNode
{
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode() : val(0), left(nullptr), right(nullptr) {}
    TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
    TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
};

class Solution
{
public:
    void flatten(TreeNode *root)
    {
        if (root == nullptr)
        {
            return;
        }

        flatten(root->left);
        flatten(root->right);

        //保存初始指针
        TreeNode *left = root->left;
        TreeNode *right = root->right;

        //左子树作为右子树
        root->left = nullptr;
        root->right = left;

        //将原先的右子树接到当前右子树的末端
        TreeNode *pRoot = root;
        while (pRoot->right != nullptr)
        {
            pRoot = pRoot->right;
        }

        pRoot->right = right;
    }
};

package main

type TreeNode struct {
	Val   int
	Left  *TreeNode
	Right *TreeNode
}

func invertTree(root *TreeNode) *TreeNode {
	//结束条件
	if root == nil {
		return nil
	}

	//翻转左右节点
	temp := root.Left
	root.Left = root.Right
	root.Right = temp

	//翻转左子树
	invertTree(root.Left)
	//翻转右子树
	invertTree(root.Right)
	return root
}