LeetCode/1008.java at main · rkibel/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
/*
import javax.swing.tree.*;
public class Problem1008 {
    public TreeNode bstFromPreorder(int[] preorder) {
        TreeNode root = recursiveNode(preorder, 0, preorder.length-1);
        return root;
    }
    public TreeNode recursiveNode (int[] preorder, int start, int end){
        if (start > end)
            return null;
        TreeNode x = new TreeNode (preorder[start]);
        int index = start + 1;
        int val = preorder[start];
        while (index <= end && preorder[index] < val)
            index++;
        x.left = recursiveNode (preorder, start+1, index-1);
        x.right = recursiveNode (preorder, index, end);
        return x;
    }
}
*/