牛客-TOP101-BM30

import java.util.*;
/**
public class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;

    public TreeNode(int val) {
        this.val = val;

    }

}
*/
public class Solution {
    public TreeNode Convert(TreeNode pRootOfTree) {
        TreeNode head = null;
        TreeNode pre = null;
        boolean sign = true;
        Deque<TreeNode> deque =  new ArrayDeque<>();
        while(!deque.isEmpty() || pRootOfTree != null){
            while(pRootOfTree != null){
                deque.addLast(pRootOfTree);
                pRootOfTree = pRootOfTree.left;
            }
            
            TreeNode t = deque.pollLast();
            if(sign == true){
                head = t;
                sign = false;
            }
            t.left = pre;
            if(pre != null)
                pre.right = t;
            pre = t;
            pRootOfTree = t.right;
        }
        return head;
    }
}