# 94. 二叉树的中序遍历
## 题目链接
[Leetcode](https://leetcode-cn.com/problems/binary-tree-inorder-traversal/)
## 解题思路
```java
Listlist =new LinkedList();
public ListinorderTraversal(TreeNode root) {
dfs(root);
return list;
}
private void dfs(TreeNode root) {
if(root ==null){
return;
}
dfs(root.left);
list.add(root.val);
dfs(root.right);
}
```
