题目描述:
给定一个二叉树的根节点 root ,返回它的 中序 遍历。
测试用例:
输入:root = [1,null,2,3]
输出:[1,3,2]
思路:
-二叉树先序遍历的特点:递归遍历左子树->根节点->递归遍历右子树
代码如下:
import java.util.ArrayList;
import java.util.List;
class TreeNode{
public int val;
public TreeNode left;
public TreeNode right;
public TreeNode(int val) {
this.val = val;
}
public TreeNode(int val, TreeNode left, TreeNode right) {
this.val = val;
this.left = left;
this.right = right;
}
}
public class Solution {
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> result = new ArrayList<>();
if (root == null){
return result;
}
result.addAll(inorderTraversal(root.left));
result.add(root.val);
result.addAll(inorderTraversal(root.right));
return result;
}
}