notes unique binary constructed using the inorder and postorder procedure for inorder traversal void inorder(tnode *pif( !nullinorder( ->lchild)printf( ->data)inorder( ->rchild) non-recursive/iterative procedure for traversing binary tree in inorder is given below for the purpose of doing the analysis void inorder(tnode *ptnode *stack[ ]int toptop if( !nulltop top stack[toppp ->lchildwhile(top while( !null/*push the left child onto the stack*top top stack[toppp ->lchild lovely professional university