94. 二叉树的中序遍历（中等题）

题目描述：
给定一个二叉树，返回它的中序 遍历。

示例:

输入: [1,null,2,3]

   1
    \
     2
    /
   3

输出: [1,3,2]

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/binary-tree-inorder-traversal
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。
递归解法：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    List<Integer> list = new ArrayList<>();

    public List<Integer> inorderTraversal(TreeNode root) {
        inorder(root);
        return list;
    }

    private void inorder(TreeNode root) {
        if(root != null){
            if(root.left != null){
                inorder(root.left);
            }
            list.add(root.val);
            if(root.right != null){
                inorder(root.right);
            }
        }
    }
}

非递归遍历：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public List<Integer> inorderTraversal(TreeNode root) {
       List<Integer> list = new ArrayList<>();
       if(root != null){
           Stack<TreeNode> st = new Stack<>();
           while (!st.empty() || root!= null){
              if(root != null){
                  st.push(root);
                  root = root.left;
              }else{
                  root = st.pop();
                  list.add(root.val);
                  root = root.right;
              }
           }
       }
       return list;
    }
}

莫里斯遍历：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public List<Integer> inorderTraversal(TreeNode root) {
       List<Integer> list = new ArrayList<>();
       TreeNode cur1 = root;
       TreeNode cur2 = root;
       while (cur1 != null){
           if(cur1.left != null){
               cur2 = cur1.left;
               while (cur2.right != null && cur2.right != cur1){
                   cur2 = cur2.right;
               }
               if(cur2.right == null){
                   cur2.right = cur1;
                   cur1 = cur1.left;
                   continue;
               }else {
                   cur2.right = null;
               }
           }
           list.add(cur1.val);
           cur1 = cur1.right;
       }
       return list;
    }
}