Linked List in C - Revision history

Tata at 17:24, 7 March 2019

2019-03-07T17:24:58Z

Tata: /* Singly Linked List */

2019-03-06T17:18:17Z

Singly Linked List

Tata: Created page with "== Doubly Linked List == #include #include typedef struct node{ int val; struct node prev, next; }node;..."

2019-03-06T17:17:51Z

Created page with "== Doubly Linked List == <syntaxhighlight lang="c++" line='line'> #include<stdio.h> #include<stdlib.h> typedef struct node{ int val; struct node *prev, *next; }node;..."

New page

== Doubly Linked List ==
<syntaxhighlight lang="c++" line='line'>
#include<stdio.h>
#include<stdlib.h>

typedef struct node{
int val;
struct node *prev, *next;
}node;

node *head = NULL;

node* insert_after(node *n, int val){
// insert_after next to current node
node *newnode = (node*)malloc(sizeof(node));
newnode->val = val;
newnode->next = NULL;
newnode->prev = NULL;
if(n == NULL){
n = newnode;
}else{
newnode->next = n->next;
newnode->prev = n;

if(n->next != NULL) n->next->prev = newnode;
n->next = newnode;
}
return n;
}

node* insert_before(node *n, int val){
if(n == NULL){
n = insert_after(n, val);
}else{
node *prev = n->prev;
if(prev == NULL){
// insert at head return new head
prev = insert_after(prev, val);
prev->next = n;
n->prev = prev;
n = prev;
}else{
prev = insert_after(prev, val);
}

}
return n;
}

node* remove(node *n){
node *removenode = n;
node *returnnode = NULL;
if(n->prev != NULL){
n->prev->next = n->next;
returnnode = n->prev;
}
if(n->next != NULL){
n->next->prev = n->prev;
returnnode = n->next;
}
free(removenode);
return returnnode;
}

void print_list(node *head){
printf("List : ");
if(head == NULL){
printf("--EMPTY--");
}
while(head != NULL){
printf("%d ", head->val);
head = head->next;
}

printf("\n");
}

int main(){
head = insert_after(head, 1);
print_list(head);
head = insert_after(head, 2);
print_list(head);
head = insert_after(head, 3);
print_list(head);
head = insert_before(head, 4);
print_list(head);
head = insert_before(head, 5);
print_list(head);

node *temp = head->next->next;
temp = insert_after(temp, 6);
print_list(head);

head = remove(head);
print_list(head);
head = remove(head);
print_list(head);
head = remove(head);
print_list(head);

temp = head->next;
temp = remove(temp);
print_list(head);

temp = head->next;
temp = remove(temp);
print_list(head);

head = remove(head);
print_list(head);
}
</syntaxhighlight>

== Singly Linked List ==
<syntaxhighlight lang="c++" line='line'>
#include<stdio.h>
#include<stdlib.h>

struct Node {
int val;
Node* next;
};

Node* new_node(int val) {
Node* node = (Node*)malloc(sizeof(Node));
node->val = val;
node->next = NULL;
return node;
}

// ถ้าไม่เจอจะ return โหนดสุดท้าย
Node* find_parent(Node* node, int val) {
if(node == NULL)return NULL;
if(node->next == NULL)return node;
if(node->next->val == val)return node;
return find_parent(node->next, val);
}

Node* find(Node* node, int val) {
if(node == NULL)return NULL;
if(node->val == val)return node;
return find(node->next, val);
}

void insert(Node* root, int val) {
Node* node = new_node(val);
node->next = root->next;
root->next = node;
}

void insert_before(Node* root, int p_val, int val) {
Node* parent = find_parent(root, p_val);
if(parent == NULL)return;
insert(parent, val);
}

void delete_node(Node* node, int val) {
Node* parent = find_parent(node, val);
if(parent == NULL)return;
if(parent->next == NULL)return;
Node* tmp = parent->next;
parent->next = parent->next->next;
free(tmp);
}

void print_recursive(Node* node) {
if(node == NULL)return;
printf("%d ", node->val);
print_recursive(node->next);
}

void print_for(Node* node) {
for( ; node != NULL; node = node->next)
printf("%d ", node->val);
}

int main(int argc, char *argv[])
{
Node* root = new_node(0);

for(int i = 1; i <= 10; i++) {
insert(root, i);
print_recursive(root->next);
printf("\n");
}
printf("\n");

for(int i = 1; i <= 10; i += 4) {
delete_node(root, i);
print_for(root->next);
printf("\n");
}
printf("\n");

for(int i = 1; i <= 10; i += 3) {
insert_before(root, i, i * 2);
print_for(root->next);
printf("\n");
}
printf("\n");

getchar();

return 0;
}
</syntaxhighlight>

@@ Line 111: / Line 111: @@
      print_list(head);
+}
 </syntaxhighlight>

@@ Line 114: / Line 114: @@
 == Singly Linked List ==
 <syntaxhighlight lang="c++" line='line'>
   #include<stdio.h>

Linked List in C - Revision history

Tata at 17:24, 7 March 2019

Tata: /* Singly Linked List */

Tata: Created page with "== Doubly Linked List == #include #include typedef struct node{ int val; struct node *prev, *next; }node;..."

Tata: Created page with "== Doubly Linked List == #include #include typedef struct node{ int val; struct node prev, next; }node;..."