Create a binary search tree from a sorted array (increasing order)
Space and indentation 

Your indentation and use of spaces is terrible. This document may help you improve your Java coding style.  

Possible overflow

You solution may cause overflow and unexpected results for big enough inputs in this line:

int mid = (start + end) / 2;


changing it to this will solve the problem:

int mid = start + (end - start) / 2;




Also returning null early looks cleaner IMO

public static Node getBST(int[] sortedArray, int start, int end) {
    if(start &gt; end) { 
        return null;
    }
    int mid = start + (end - start) / 2;
    Node root = new Node(sortedArray[mid]);
    root.left = getBST(sortedArray, start, mid - 1);
    root.right = getBST(sortedArray, mid + 1, end);
    return root;    
}