数据结构上机实验报告-二叉树(7)

else { root = s.top(); visit(root); s.pop(); root = root->right; } } } void BT_PostOrder(pTreeT root) { if (NULL != root) { BT_PostOrder(root->left); BT_PostOrder(root->right); visit(root); } }