Recursive function to construct binary of size len from Inorder traversal inorder [ ] . Initial values of start and end should be 0 and len - 1.
node * buildTree ( int inorder [ ] , int start , int end ) { if ( start > end ) return NULL ;