Non-recursive notation of binary tree pre-sequence traversal

Pre-sequence traversal non-recursive relying on the stack implementation, relatively simple, first to use handwriting simulation of basic can know how to write

You can get the following code

voidPreorder_stack (Bitree T) {printf ("\ n Non-recursive first-order traversal result: \ n"); Initstack (&sqstack); Bitree P=u; Push (&sqstack,p);  while(!Stackempty (Sqstack)) {Pop (&sqStack,&p); printf ("%d",p->data); if(p->rchild) {Push (&sqStack,p->rchild); }        if(p->lchild) {Push (&sqStack,p->lchild); }    }}

Use of the function is not all posted out, the idea above should be said to be more clear

Non-recursive notation of binary tree pre-sequence traversal