94 二叉树的中序遍历
基础模板题,利用递归遍历二叉树
/**
* 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 {
private List<Integer> res = new ArrayList<>();
public void inorder(TreeNode root){
if (root == null) return;
inorder(root.left);
//前序在前,中序中间,后续最后
res.add(root.val);
inorder(root.right);
}
public List<Integer> inorderTraversal(TreeNode root) {
inorder(root);
return res;
}
}