题解 | #二叉树的中序遍历#
二叉树的中序遍历
https://www.nowcoder.com/practice/0bf071c135e64ee2a027783b80bf781d
import java.util.*; /* * public class TreeNode { * int val = 0; * TreeNode left = null; * TreeNode right = null; * public TreeNode(int val) { * this.val = val; * } * } */ public class Solution { /** * 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可 * * * @param root TreeNode类 * @return int整型一维数组 */ public int[] inorderTraversal (TreeNode root) { ArrayList<Integer> list = new ArrayList<>(); inorder(list, root); int[] res = new int[list.size()]; for (int i = 0; i < res.length; i++) { res[i] = list.get(i); } return res; } public void inorder(ArrayList<Integer> list, TreeNode root) { if(root == null){ return; } inorder(list,root.left); list.add(root.val); inorder(list,root.right); } }
二叉树中序遍历,这个难度设置有问题,不应该设置为中等难度,应该为简单