Assume that inorder traversal of following tree is given 40 / \ 10 30 / \ 5 28
int inorder [ ] = new int [ ] { 5 , 10 , 40 , 30 , 28 } ; int len = inorder . length ; Node mynode = tree . buildTree ( inorder , 0 , len - 1 , tree . root ) ;