TWDH#Leetcode-From-Zero#02.二叉树的中序遍历1

# 2. 二叉树的中序遍历  ## 1.迭代(Iterative) #### 套路模板： * 另一种写法：详见**Leetcode98** ```java //迭代法：套路 class Solution { public List inorderTraversal(TreeNode root) { //1.创建res存储答案 List res = new ArrayList<>(); //2.创建stack模仿递归 Deque stack = new LinkedList<>(); TreeNode node = root; //3.遍历 while(!stack.isEmpty() || node != null){ if(node != null){ stack.push(node); //左 node = node.left; }