notes stack[top]top top-lprintf( ->data) ->rchildif( !null/*push right child*top top+ stack[toppp ->lchildanalysis consider the iterative version of the inorder given above if the binary tree to be traversed is having nodesthen the number of nil links is since every node is placed on the stack oncethe statements stack[top: and :stack[topare executed times the test for nil links will be done exactly times so every step will be executed no more than some small constant times nhence the order of algorithm (nsimilar analysis can be done to obtain the estimate of the computation time for preorder and post order preorder traversal void preorder(tnode *pif( !nullprintf( ->data)preorder( ->lchild)preorder( ->rchild)postorder traversal void postorder(tnode *pif(!ppostorder( ->lchild)postorder( ->rchild)printf( ->data)lovely professional university