给出一棵二叉树,返回这棵树的中序遍历
//递归,o(n)t(n)
解题思路:
1.根节点不空时,
2.左子树不空,遍历左子树
3.根节点值加入到结果中
4.右子树不空,遍历右子树
import java.util.*;
/*
* public class TreeNode {
* int val = 0;
* TreeNode left = null;
* TreeNode right = null;
* }
*/
public class Solution {
/**
*
* @param root TreeNode类
* @return int整型ArrayList
*/
public ArrayList<Integer> inorderTraversal (TreeNode root) {
ArrayList<Integer>list=new ArrayList<>();
helper(root,list);
return list;