text: Function to construct a BST from the sorted array arr [ ]
code: public static Node constructBST ( int [ ] arr , int start , int end , Node root ) { if ( start > end ) return null ; int mid = ( start + end ) / 2 ;