Create tree ( Using preorder and inorder)

#1

in this question plz explain the display function wisely, algo to print the output??? plz asap,ty

#2

Basically, if you carefully notice by dry run, you will analyze that it is preorder printing of tree, with constraints, or conditions, like for eg,
if(root->left!=NULL && root->right==NULL)
{
cout<left->data<<" => “<data<<” <= “<<“END”<<endl;
}
if(root->left ==NULL && root->right==NULL)
{
cout<<“END”<<” => “<data<<” <= "<<“END”<<endl;
}

you need to first analyze the tree and its order carefully, only then you will be able to get this printing.