二叉树中序遍历的迭代法

/**
 * 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> inorderTraversal(TreeNode root) {

建立一个集合，用来存放结果
    List<Integer> list = new ArrayList<>();

栈或者队列，用来迭代
    Stack<TreeNode> stack = new Stack<>();
    TreeNode temp = root;

如果后面取出的右子节点为空，仍然可以遍历
   while(stack.size() > 0 || temp != null){

首先一直先左子节点，如果有的话，压入栈
       while(temp != null){