【打卡第226道】【二叉树非递归（迭代）遍历】【leetCode高频】：94. 二叉树的中序遍历；144. 二叉树的前序遍历；145. 二叉树的后序遍历

1、题目描述

①前序

②中序

 

③后续

 

3、分析

二叉树的非递归遍历采用的栈进行操作来存储元素。

①前序：

前序遍历的顺序是  中-左-右。

将root元素存储到栈中，当栈不为空的时候，出栈元素，将出栈的元素添加到结果集中，所以现在只需要看左右结点的顺序。因为栈存储是先进后出的。存储顺序是：右-左；出栈元素顺序是：左-右。

②中序：

中序遍历的顺序是 左-中-右

定义指针访问结点，左结点一直遍历到底部。将访问到的结点放进栈中。

看代码，代码比较清晰。

 ③后序

先序遍历是遍历的是中-左-右，后序遍历是左-右-中；所以调整下遍历顺序；先序遍历：中-左-右；调整下遍历顺序是：中-右-左；反转下顺序：左-右-中

代码;

3、代码实现

①前序

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 
 */
class Solution {
    // 二叉树的非递归遍历
    public List<Integer> preorderTraversal(TreeNode root) {
       List<Integer> res = new ArrayList<>();
       if(root == null){
           return res;
       }
       Stack<TreeNode> stack = new Stack<>();
       stack.push(root);
       while(!stack.isEmpty()){
           TreeNode node = stack.pop();
           res.add(node.val);
           if(node.right != null){
               stack.push(node.right);
           }
           if(node.left != null){
               stack.push(node.left);
           }
       }
       return res;
    }
}

②中序

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
 
import java.util.*;
class Solution {
    public List<Integer> inorderTraversal(TreeNode root) {
        List<Integer> res = new ArrayList<>();
        if(root == null){
            return res;
        }
        Stack<TreeNode> stack = new Stack<>();
        TreeNode cur = root;
        while(cur != null || !stack.isEmpty()){
            if(cur != null){
                stack.push(cur);
                cur = cur.left;
            }else{
                cur = stack.pop();
                res.add(cur.val);
                cur = cur.right;
            }
        }
        return res;
    }
}

③后序

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public List<Integer> postorderTraversal(TreeNode root) {
        List<Integer> res = new ArrayList<>();
        if(root == null){
            return res;
        }
        Stack<TreeNode> stack = new Stack<>();
        stack.push(root);
        while(!stack.isEmpty()){
            TreeNode node = stack.pop();
            res.add(node.val);
            if(node.left != null){
                stack.push(node.left);
            }
            if(node.right != null){
                stack.push(node.right);
            }
        }
        Collections.reverse(res);
        return res;
    }
}