LeetCode – Refresh – Flatten Binary Tree To Linked List

最新推荐文章于 2024-05-22 17:02:02 发布

helloxielan

最新推荐文章于 2024-05-22 17:02:02 发布

阅读量73

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/shuashuashua/p/4349626.html

本文介绍了一种将二叉树数据结构进行扁平化的算法实现，通过修改树节点的左右指针来达到遍历的效果，使得原本的二叉树能够转化为一个链式结构，便于进一步处理。

Logic is simple, but careful with the details.

 1 /**
 2  * Definition for binary tree
 3  * struct TreeNode {
 4  *     int val;
 5  *     TreeNode *left;
 6  *     TreeNode *right;
 7  *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 8  * };
 9  */
10 class Solution {
11 public:
12     void flatten(TreeNode *root) {
13         if (!root) return;
14         flatten(root->left);
15         flatten(root->right);
16         TreeNode *runner = root->left;
17         if (!root->left) return;
18         else {
19             while (runner->right) runner = runner->right;
20         }
21         runner->right = root->right;
22         root->right = root->left;
23         root->left = NULL;
24     }
25 };