Flatten Binary Tree to Linked List

最新推荐文章于 2024-10-15 19:28:18 发布

luckywqf

最新推荐文章于 2024-10-15 19:28:18 发布

阅读量320

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/luckywqf/article/details/50241321

版权

leetcode 专栏收录该内容

7 篇文章 0 订阅

订阅专栏

Flatten Binary Tree to Linked List

Given a binary tree, flatten it to a linked list in-place.

For example,
Given

The flattened tree should look like:

1
\
2
\
3
\
4
\
5
\
6

Hints:
If you notice carefully in the flattened tree, each node’s right child points to the next node of a pre-order traversal.

如果没有特殊要求，一般二叉树的相关算法都可以递归实现，此题也不例外。
实现函数，扁平化二叉树，并返回叶子结点。代码如下：

void flatten(TreeNode* root) {
    if (root == nullptr) {
        return;
    }
    flattenTree(root);
}
TreeNode* flattenTree(TreeNode* root) {
    if (root->left == nullptr && root->right == nullptr) {
        return root;
    }
    TreeNode *rightEnd;
    if (root->left) {
        auto right = root->right;
        root->right = root->left;
        rightEnd = flattenTree(root->left);
        if (right) {
            rightEnd->right = right;
            rightEnd = flattenTree(right);
        }
        root->left = nullptr;
    } else if (root->right) {
        rightEnd = flattenTree(root->right);
    }
    return rightEnd;
}