[LeetCode]Flatten Binary Tree to Linked List

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

转载最新推荐文章于 2022-09-06 16:04:14 发布 · 59 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/Rosanna/p/3595938.html

本文介绍了一种将二叉树结构通过特定算法展平为链表的方法。该方法利用递归技术，首先展平左右子树，然后调整根节点的左右指针指向，最终使整棵树变为按先序遍历顺序排列的链表。

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

For example,
Given

The flattened tree should look like:

click to show hints.

Hints:

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

/**
 * 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) {
        if(root==NULL) return;
        if(root->left==NULL&&root->right==NULL) return;
        flatten(root->left);
        flatten(root->right);
        TreeNode *p=root->right;
        root->right=root->left;
        root->left=NULL;
        TreeNode *r=root;
        while(r->right)
        {
            r=r->right;
        }
        r->right=p;
    }
};

转载于:https://www.cnblogs.com/Rosanna/p/3595938.html