难度中等481收藏分享切换为英文关注反馈
给定一个二叉树,返回它的中序 遍历。
示例:
输入: [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<>();
zhongxu(root,list);
return list;
}
public void zhongxu(TreeNode root,List<Integer> list) {
if(root==null)
return ;
if(root.left!=null)
zhongxu(root.left,list);
list.add(root.val);
if(root.right!=null)
zhongxu(root.right,list);
}
}