notes return( )/this code is for deleting node with no child*if( ->lchild =null & ->rchild =nullif( ->lchild =xy->lchild null else ->rchild nullfree( )return( )/*an iterative function to print the binary tree in inorder*void inorder (struct tnode *pstruct tnode *stack[ ]int toptop - if( !nulltop++stack[toppp ->lchildwhile(top > while !null)/push the left child onto stack*top++stack[top=pp ->lchildp stack[top]top-printf("% \ ", ->data) ->rchildif !null/push right child*top++stack[toppp ->lchildlovely professional university