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

{ if (NULL != root) { visit(root); BT_PreOrder(root->left); BT_PreOrder(root->right); } } void BT_PreOrderNoRec(pTreeT root) { stack<treeT *> s; while ((NULL != root) || !s.empty()) { if (NULL != root) { visit(root); s.push(root); root = root->left; } else { root = s.top(); s.pop();