Java面试-leetcode题解之第94题二叉树的中序遍历.zip

import java.util.ArrayList; import java.util.List; public class Solution { public List<Integer> inorderTraversal(TreeNode root) { List<Integer> res = new ArrayList<>(); dfs(root, res); return res; } private void dfs(TreeNode node, List<Integer> res) { if (node == null) { return; } dfs(node.left, res); res.add(node.val); dfs(node.right, res); } }