摘要: 树的操作: 1、树的构建 Node build(Node p, int &k, string s){ if(s[k] == '#'){ k++; return NULL; } p = new node(); p -> ch = s[k++]; p -> lc = build(p->lc,k,s); 阅读全文
posted @ 2023-10-16 10:54 a_true 阅读(42) 评论(0) 推荐(0)