摘要: 二叉树的存储 struct node { typename data; node* lchild; node* rchild; }; node* root = NULL; node* newNode(int v) { node* Node = new node; Node->data = v; No 阅读全文
posted @ 2020-03-07 15:18 yoyoyayababy 阅读(127) 评论(0) 推荐(0) 编辑