能帮我改改二叉树的LNR顺序递归吗

Question

很艰苦环境和艰苦看见好看皇家空军航空来看看了高端时尚的风格什么是他们让我让你

Answer 1

部分代码，具体回复我私信吧，题主代码存在malloc语法错误，以及结构定义错误等bug

List TreeSearchBetween(Tree t, Record lower, Record upper) {
    List l;
    l=ListNew(l); 
    doTreeSearchBetween(t,t->root,lower,upper,&l);
    return l;
}
//中序遍历
// n - the current node
// l - a list to accumulate results
static void doTreeSearchBetween(Tree t, Node n, Record lower,
                                Record upper, List *l) {
    if (n != NULL) {
        doTreeSearchBetween(t,n->left,lower,upper,l);
        if(t->compare(n->rec,lower)>=0 && t->compare(upper,n->rec)>=0){//lower<=value<=upper
            Node node = (Node)malloc(sizeof(node));
            node->left=node->right=NULL;
            node->rec=RecordNew(n->rec->zid,n->rec->familyName,n->rec->givenName);
            ListAppend(l,n->rec);
        }
        doTreeSearchBetween(t,n->right,lower,upper,l);
    }
}