}InsertNode(self,p,i); } } 开发者ID:1051215684,项目名称:theunarchiver,代码行数:55,代码来源:SubAllocatorVariantH.c 示例6: InsertNode ▲点赞 1▼ voidInsertNode(BinaryTree *root, BinaryTree *node){if(root->value < node->value){if(root->rNode ==NULL) root->rNode = node;elseInsertNode(...
代码实现：node * InsertNode (node * head, int x){ node * last, * current, * p;//要插入的结点 p = (node *)malloc(sizeof(node));p->num = x;//空表插入 if(head == NULL){ head = p;p->next = NULL;return head;} //找插入位置 current = head;while(x > current-...