If current node is equal to arr [ index ] this means that till this level path has been matched and remaining path can be either in left subtree or right subtree .
return ( ( index < n ) && ( root -> data == arr [ index ] ) && ( existPathUtil ( root -> left , arr , n , index + 1 ) || existPathUtil ( root -> right , arr , n , index + 1 ) ) ) ; }