题目
给定一个二叉树,返回它的中序 遍历。
示例:
输入: [1,null,2,3] 1 \ 2 / 3 输出: [1,3,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){
add(list,root);
}
return list;
}
public void add(List<Integer> list, TreeNode root){
TreeNode left = root.left;
TreeNode right = root.right;
if(left != null){
add(list, left);
}
list.add(root.val);
if(right != null){
add(list, right);
}
}
}