LEETCODE: Flatten Binary Tree to Linked List

停止更新+1

于 2014-12-31 20:15:14 发布

阅读量277

点赞数

CC 4.0 BY-SA版权

文章标签： LEETCODE 二叉树算法

本文链接：https://blog.youkuaiyun.com/anyicheng2015/article/details/42299637

LEETCODE 专栏收录该内容

153 篇文章

订阅专栏

本文详细介绍了如何通过迭代方法将给定的二叉树结构平铺成一个链表，包括关键步骤、示例代码及最终结果展示。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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 != NULL) {
            if(root->left != NULL) {
                TreeNode *rightmost = root->left->right;
                while(rightmost != NULL && rightmost->right != NULL) {
                    rightmost = rightmost->right;
                }
                TreeNode *rootright = root->right;
                if(rightmost == NULL) {
                    rightmost = root->left;
                }
                root->right = root->left;
                root->left = NULL;
                rightmost->right = rootright;
            }
            root = root->right;
        }
    }
};