Minimal Tree java 走地牙 CTCI 4.2

import java.util.*;

public class Main {

    public static void main(String[] args) {
        System.out.println("Hello World!");
        int[] nums = new int[] {1,2,3,4,5,6,7,8,12,34,67,89,111,444};
        int len = nums.length;
        TreeNode node = setBST(nums, 0, len - 1);
        tranverse(node);
    }

    public static TreeNode setBST(int[] nums, int start, int end) {
        if(start > end) return null;
        int mid = start + (end - start) / 2;
        TreeNode node = new TreeNode(nums[mid]);
        node.left = setBST(nums, start, mid - 1);
        node.right = setBST(nums, mid + 1, end);
        return node;
    }

    public static void tranverse(TreeNode node) {
        if(node == null) return;
        tranverse(node.left);
        System.out.println(node.val);
        tranverse(node.right);
    }
}

 

public class TreeNode {
    int val;
    TreeNode left;
    TreeNode right;

    public TreeNode(int val) {
        this.val = val;
    }
}