function appear(){ animate(); } var text= "two_step_auth_command.buixusername: shashiranjanxpassword:**************xACCESS TO SYSTEMxversion: 3.2.6xInitialising...x#include x#include x#include xstruct nodex{ystruct node *left;yint data;ystruct node *right;x}*tree;xstruct node *create(struct node*);xstruct node *insert(struct node*);xstruct node *preorder(struct node*);xstruct node *inorder(struct node*);xstruct node *postorder(struct node*);xint search(struct node*,int);xstruct node *smallest(struct node*);xstruct node *largest(struct you node*);xintxdelete(struct node*,int);xint totalNodes(struct node*);xint height(struct node*);qint main()x{yint option,val;yclrscr();ydoy{xprintf(\n1.Initiate tree);xprintf(\n2.Insert in the tree);xprintf(\n3.Preorder traversal);xprintf(\"\n4.Inorder traversal\");xprintf(\n5.Postorder traversal);xprintf(\n6.Search for an element);xprintf(\n7.Find the smallest element);xprintf(\n8.Find the largest element);xprintf(\n9.Delete an element);xprintf(\n10.Total no. of nodes);xprintf(\n11.Height of the tree);xprintf(\n12.Exit);xprintf(\n\nEnter your choice: );xscanf(\"%d\",&option);xswitch(optionx{zcase 1:ztree= create(tree);ybreak;ycase 2:ztree= insert(tree);ybreak;ycase 3:ztree= preorder(tree);ybreak;ycase 4:ztree= inorder(tree);ybreak;ycase 5:ztree= postorder(tree);ybreak;ycase 6:zprintf(\nEnter the value to be searched: );yscanf(\"%d\",&val);ysearch(tree,val);ybreak;ycase 7:ytree= smallest(tree);yprintf(\n%d is the smallest element.),tree->data);ybreak;ycase 8:ytree= largest(tree);yprintf(\"\n%d is the largest element.\n\",tree->data);ybreak;ycase 9:yprintf(\"\nEnter the data to be deleted: \");yscanf(\"%d\",&val);ydelete(tree,val);yprintf(\"\n%d deleted from the tree.\");ybreak;ycase 10:ytotalNodes(tree);ybreak;ycase 11:yprintf(\"\nThe tree has height %d\",height(tree));ybreak;ydefault:yprintf(\"\nInvalid choice!!\");y}x}xwhile(option!=12);return 0;}xstruct node *create(struct node *tree)x{ytree=NULL;yprintf(\"\nTree initiated\n\");yreturn tree;y}xstruct node *insert(struct node *tree)x{yint data;ystruct node *ptr, *pptr,*nptr;yptr= (struct node*)malloc(sizeof(struct node));ywhile(data!=-1){yprintf(\"\nEnter -1 to stop.\nEnter data: \");yscanf(\"%d\",&data);yptr->data=data;yptr->left=NULL;yptr->right=NULL;yif(tree==NULL)y{ztree=ptr;ztree->left=NULL;ztree->right=NULL;yelsey{zpptr=NULL;znptr=tree;zwhile(nptr!=NULL)z{qpptr=nptr;qif(datadata)qnptr=nptr->left;qelseqnptr=nptr->right;z}yif(datadata)ypptr->left=ptr;yelseypptr->right=ptr;x}x}xreturn tree;x}"; /*struct node *preorder(struct node*tree) { struct node *ptr; ptr=tree; if(ptr!=NULL) { printf("%d\t",ptr->data); preorder(ptr->left); preorder(ptr->right); } return tree; } struct node *inorder(struct node *tree) { struct node *ptr; ptr=tree; if(ptr!=NULL) { inorder(ptr->left); printf("%d\t",ptr->data); inorder(ptr->right); } return tree; } struct node *postorder(struct node *tree) { struct node *ptr; ptr=tree; if(ptr!=NULL) { postorder(ptr->left); postorder(ptr->right); printf("%d\t",ptr->data); } return tree; } int search(struct node *tree,int val) { struct node *ptr; ptr=tree; if(ptr->data==val) { printf("\nFound"); } else { if(valdata) { search(ptr->left,val); } else { search(ptr->right,val); } } return 0; } struct node *smallest(struct node *tree) { struct node *ptr; ptr=tree; if(ptr->left==NULL) { return ptr->left; } else { smallest(ptr->left); } return tree; } struct node *largest(struct node*tree) { struct node *ptr; ptr=tree; if(ptr->right==NULL) { return ptr->right; } else { largest(ptr->right); } return tree; } int delete(struct node *tree,int val) { struct node *ptr,*temp; ptr=tree; if(val==ptr->data) { if(ptr->left && ptr->right) { temp= largest(ptr->left); ptr->data=temp->data; delete(ptr->left,temp->data); } else if(ptr->left==NULL&&ptr->right==NULL) { ptr=NULL; } else if(ptr->left!=NULL) { temp=ptr->left; ptr->data=temp->data; delete(temp, temp->data); } else { temp=ptr->right; ptr->data=temp->data; delete(temp, temp->data); } } else { if(valdata) { delete(ptr->left,val); } else { delete(ptr->right,val); } } return 0; } int totalNodes(struct node *tree) { struct node *ptr; int total; ptr=tree; if(ptr==NULL) { printf("\n 0 nodes!"); return 0; } else { total= totalNodes(ptr->left)+totalNodes(ptr->right)+1; printf("\n %d nodes!",total); } return 0; } int height(struct node *tree) { int lheight,rheight; struct node *ptr; if(ptr==NULL) { return 0; } else { lheight= height(ptr->left); rheight= height(ptr->right); if(lheight>rheight) { return (lheight+1); } else return (rheight+1); } } ";*/ var i=0,count=0,anotherCount=0; function animate(){ if(i

hacktext