诡异的二叉树非递归遍历之前序

xiaoxiao2021-02-28  9

void pre_order (BTreeNode *node) { if (node == NULL) { errno = ERROR; return; } LinkStack *Stack = Create_Stack (); BTreeNode *tmp = node;   //指向当前节点 while (tmp) { printf("L",tmp->data); Push (Stack,tmp); if (tmp->lchild) { tmp = tmp->lchild; continue; } while(StackEmpty(Stack) != TRUE) { Pop (Stack,&tmp); if(tmp = tmp->rchild) { break; } } } }
转载请注明原文地址: https://www.6miu.com/read-1250285.html

最新回复(0)