1、题目描述:
2、代码实现:
/**
* 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){
return list;
}
inorderTraversal(root,list);
return list;
}
public void inorderTraversal(TreeNode root,List<Integer> list){
if(root.left!=null){
inorderTraversal(root.left,list);
}
list.add(root.val);
if(root.right!=null){
inorderTraversal(root.right,list);
}
}
}