该程序段实现简介。采用stack模拟函数堆栈。 源码 如下: void InorderTraversalNonRcsve(PTreeNode pTreeRoot) { Stack stack; IniSatck(&stack); PTreeNode pNode = pTreeRoot; while (pNode != NULL) { Push(&stack,(DWORD)pNode); pNode = pNode->pLeftChild; while ( pNode== NULL) { if (StackEmpty(&stack)) { break; } pNode = (PTreeNode)Pop(&stack); printf("%d /r/n",pNode->value); pNode = pNode->pRightChild; } } }