[LeetCode] Flatten Binary Tree to Linked List

最新推荐文章于 2022-09-06 16:04:14 发布

原创最新推荐文章于 2022-09-06 16:04:14 发布 · 314 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

131 篇文章

订阅专栏

本文深入探讨了如何通过迭代方式将二叉树结构转化为链表，具体步骤包括遍历左子树并更新指针指向，直至节点为空，确保链表的正确构建。

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

For example,
Given

The flattened tree should look like:

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    void flatten(TreeNode *root) {
        while(root){
            if(root -> left){
                TreeNode *pre = root -> left;
                while(pre -> right)
                    pre = pre -> right;
                pre -> right = root -> right;
                root -> right = root -> left;
                root -> left = NULL;
            }
            root = root -> right;
        }
    }
};