infix.h

来自「data structures, algorithms and Applicat」· C头文件 代码 · 共 10 行

template <class T>
void Infix(BinaryTreeNode<T> *t)
{// Output infix form of expression.
   if (t) {cout << '(';
           Infix(t->LeftChild);  // left operand
           cout << t->data;      // operator
           Infix(t->RightChild); // right operand
           cout << ')';}
}