题解 | #农场牛的最佳观赏次序#

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整型一维数组
     */
    ArrayList<Integer> list = new  ArrayList<Integer>();
    public int[] inorderTraversal (TreeNode root) {
        // write code here
        dfs(root);
        Collections.sort(list);
        int[] arr = new int[list.size()];
        for(int i=0;i<list.size();i++){
            arr[i]=list.get(i);
        }
        return arr;
    }

    public void dfs(TreeNode root){
        if(root==null){
            return;
        }
        list.add(root.val);
        dfs(root.left);
        dfs((root.right));
    }
}