/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
private LinkedList<TreeNode> q;
public void flatten(TreeNode root) {
// Start typing your Java solution below
// DO NOT write main() function
if(root == null) return;
if(root.right==null&&root.left==null)return;
q = new LinkedList<TreeNode>();
enque(root);
TreeNode pre = q.remove();
pre.left = null;
while(!q.isEmpty()){
TreeNode now = q.remove();
pre.right = now;
pre = now;
pre.left = null;
}
}
private void enque(TreeNode root){
if(root == null) return;
q.add(root);
enque(root.left);
enque(root.right);
}
}
Flatten Binary Tree to Linked List
最新推荐文章于 2024-08-25 16:11:27 发布