数据结构遍历二叉树先序

statusPreorderTraverse(BiTreeT),status(*Visit(TElemTypee)){if(T){if(visit(T->data))if(Preordertaverse(T->lchild,visit))if(Preordertaverse(T->Rchild,visit))returnOK;returnError;}elsereturnOK;}}//PreorderTraverse