114. Flatten Binary Tree to Linked List

发布时间：2020-12-14 03:45:06 所属栏目：大数据来源：网络整理

导读：把左边=null,把最左边遍历到null 保证已经flatten 然后再弄右边然后把root.right跟左边连接,再把右边连接到root.right的最下面 https://leetcode.com/problems/flatten-binary-tree-to-linked-list/discuss/36987/Straightforward-Java-Solution ? ? 1 clas

把左边=null,把最左边遍历到null 保证已经flatten 然后再弄右边然后把root.right跟左边连接,再把右边连接到root.right的最下面

https://leetcode.com/problems/flatten-binary-tree-to-linked-list/discuss/36987/Straightforward-Java-Solution

 1 class Solution {
 2     public void flatten(TreeNode root) {
 3         if(root == null) return;
 4         TreeNode left = root.left;
 5         TreeNode right = root.right;
 6         root.left = null;
 7         
 8         flatten(right);
 9         flatten(left);
10         root.right = left;
11         TreeNode cur = root;
12         while(cur.right != null) cur = cur.right;
13         cur.right = right;
14         
15     }
16 }

（编辑：李大同）

【声明】本站内容均来自网络，其相关言论仅代表作者个人观点，不代表本站立场。若无意侵犯到您的权利，请及时与联系站长删除相关内容!