Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- Node *insert(Node *H, int index, char *number)
- {
- Node *check = H;
- if (H == NULL)
- {
- Node *newNode = (Node *)malloc(sizeof(Node));
- newNode->definition = number;
- newNode->next = NULL;
- check->next = newNode;
- return check;
- }
- while (check->next != NULL)
- {
- check = check->next;
- }
- Node *newNode = (Node *)malloc(sizeof(Node));
- newNode->definition = number;
- newNode->next = NULL;
- check->next = newNode;
- return check;
- }
- //Trying to create alphabetized LList ------------------------
- cout << "#" << flush;
- for (string x1 : fin_str_set)
- {
- char * x2 = {(char *)x1.c_str()};
- insert(x, 0, x2);
- }
- cout << "#" << flush;
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement