java 144.二叉树Preorder Traversal（Morris）.java

Posted 2021-05-08

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
 
 // eg:[10,5,30,-2,6,12,40,null,2,null,null,null,null,null,null,-1]
public class Solution {
    public List<Integer> preorderTraversal(TreeNode root) {
        List<Integer> res = new LinkedList<Integer>();
        Deque<TreeNode> stack = new ArrayDeque<TreeNode>();
        
        TreeNode cur = root;
        while( cur != null || !stack.isEmpty()){
            while( cur != null){
                res.add(cur.val);
                stack.push(cur);
                cur = cur.left;
            }

            cur = stack.pop();
            cur = cur.right;
        }
        return res;
    }
}

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
 
 // eg:[10,5,30,-2,6,12,40,null,2,null,null,null,null,null,null,-1]
public class Solution {
    public List<Integer> preorderTraversal(TreeNode root) {
        List<Integer> res = new LinkedList<Integer>();
        
        helper(root,res);
        
        return res;
    }
    
    public void helper(TreeNode root, List<Integer> res){
        if (root == null) return;
        res.add(root.val);
        helper(root.left, res);
        helper(root.right, res);
    }
}

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
 
 // eg:[10,5,30,-2,6,12,40,null,2,null,null,null,null,null,null,-1]
public class Solution {
    public List<Integer> preorderTraversal(TreeNode root) {
        List<Integer> res = new LinkedList<Integer>();
        
        TreeNode cur = root;
        
        while( cur != null) {
            
            if (cur.left == null){
                res.add(cur.val);
                cur = cur.right;
            } else {
                TreeNode temp = cur.left;
                
                while( temp.right != null && temp.right != cur){
                    temp = temp.right;
                }
                
                if(temp.right == null){
                    temp.right = cur;
                    res.add(cur.val);
                    cur = cur.left;
                } else {
                    temp.right = null;
                    cur = cur.right;
                }
            }
            
        }
        
        return res;
    }
}