Notes
Notes - notes.io |
#include <stdlib.h>
typedef struct node {
int data;
struct node *next;
struct node *prev;
}node;
typedef struct linked_list {
struct node *head;
}linked_list;
//to make new node
node* new_node(int data) {
node *z;
z = malloc(sizeof(struct node));
z->data = data;
z->next = NULL;
z->prev = NULL;
return z;
}
//to make a new linked list
linked_list* new_linked_list(int data) {
node *a; //new node for head of linked list
a = new_node(data);
linked_list *l = malloc(sizeof(linked_list)); //linked list
l->head = a;
return l;
}
void traversal(linked_list *l) {
node *temp = l->head; //temporary pointer to point to head
while(temp != NULL) { //iterating over linked list
printf("%dt", temp->data);
temp = temp->next;
}
printf("n");
}
//new node before head
void insert_at_front(linked_list *l, node *n) {
n->next = l->head;
l->head->prev = n;
l->head = n;
}
//insert new node at last
void insert_at_tail(linked_list *l, node *n) {
node *temp = l->head;
while(temp->next != NULL) {
temp = temp->next;
}
temp->next = n;
n->prev = temp;
}
//function to insert a node after a node
void insert_after(node *n, node *a) {
n->next = a->next;
a->next->prev = n;
a->next = n;
n->prev = a;
}
//function to delete
void del(linked_list *l, node *a) {
if(a->prev != NULL) { //node is not head
a->prev->next = a->next;
}
else { //node a is head
l->head = a->next;
}
if(a->next != NULL) {
a->next->prev = a->prev;
}
free(a);
}
void deleteNodesWithLogic(linked_list *l) {
struct node buckets[100];
int index = 0;
node *temp = l->head; //temporary pointer to point to head
while(temp != NULL) { //iterating over linked list
int p = temp->prev == NULL ? 0 : temp->prev->data;
int pp;
if (temp->prev == NULL) {
pp = 0;
} else {
pp = temp->prev->prev == NULL ? 0 : temp->prev->prev->data;
}
int sum = p+pp;
if(temp->data > sum) {
buckets[index] = *temp;
index++;
}
temp = temp->next;
}
for(int i = 0; i < (sizeof(buckets)/sizeof(node)); i++) {
del(l,&buckets[i]);
}
}
int main() {
linked_list *l = new_linked_list(10);
node *a, *b, *c; //new nodes to insert in linekd list
a = new_node(20);
b = new_node(50);
c = new_node(60);
l->head->next = a;
a->next = b;
b->next = c;
traversal(l);
deleteNodesWithLogic(l);
traversal(l);
return 0;
}#include <stdio.h>
#include <stdlib.h>
typedef struct node {
int data;
struct node *next;
struct node *prev;
}node;
typedef struct linked_list {
struct node *head;
}linked_list;
//to make new node
node* new_node(int data) {
node *z;
z = malloc(sizeof(struct node));
z->data = data;
z->next = NULL;
z->prev = NULL;
return z;
}
//to make a new linked list
linked_list* new_linked_list(int data) {
node *a; //new node for head of linked list
a = new_node(data);
linked_list *l = malloc(sizeof(linked_list)); //linked list
l->head = a;
return l;
}
void traversal(linked_list *l) {
node *temp = l->head; //temporary pointer to point to head
while(temp != NULL) { //iterating over linked list
printf("%dt", temp->data);
temp = temp->next;
}
printf("n");
}
//new node before head
void insert_at_front(linked_list *l, node *n) {
n->next = l->head;
l->head->prev = n;
l->head = n;
}
//insert new node at last
void insert_at_tail(linked_list *l, node *n) {
node *temp = l->head;
while(temp->next != NULL) {
temp = temp->next;
}
temp->next = n;
n->prev = temp;
}
//function to insert a node after a node
void insert_after(node *n, node *a) {
n->next = a->next;
a->next->prev = n;
a->next = n;
n->prev = a;
}
//function to delete
void del(linked_list *l, node *a) {
if(a->prev != NULL) { //node is not head
a->prev->next = a->next;
}
else { //node a is head
l->head = a->next;
}
if(a->next != NULL) {
a->next->prev = a->prev;
}
free(a);
}
void deleteNodesWithLogic(linked_list *l) {
struct node buckets[100];
int index = 0;
node *temp = l->head; //temporary pointer to point to head
while(temp != NULL) { //iterating over linked list
int p = temp->prev == NULL ? 0 : temp->prev->data;
int pp;
if (temp->prev == NULL) {
pp = 0;
} else {
pp = temp->prev->prev == NULL ? 0 : temp->prev->prev->data;
}
int sum = p+pp;
if(temp->data > sum) {
buckets[index] = *temp;
index++;
}
temp = temp->next;
}
for(int i = 0; i < (sizeof(buckets)/sizeof(node)); i++) {
del(l,&buckets[i]);
}
}
int main() {
linked_list *l = new_linked_list(10);
node *a, *b, *c; //new nodes to insert in linekd list
a = new_node(20);
b = new_node(50);
c = new_node(60);
l->head->next = a;
a->next = b;
b->next = c;
traversal(l);
deleteNodesWithLogic(l);
traversal(l);
return 0;
}
|
|
Notes is a web-based application for online taking notes. You can take your notes and share with others people. If you like taking long notes, notes.io is designed for you. To date, over 8,000,000,000+ notes created and continuing...
With notes.io;
- * You can take a note from anywhere and any device with internet connection.
- * You can share the notes in social platforms (YouTube, Facebook, Twitter, instagram etc.).
- * You can quickly share your contents without website, blog and e-mail.
- * You don't need to create any Account to share a note. As you wish you can use quick, easy and best shortened notes with sms, websites, e-mail, or messaging services (WhatsApp, iMessage, Telegram, Signal).
- * Notes.io has fabulous infrastructure design for a short link and allows you to share the note as an easy and understandable link.
Fast: Notes.io is built for speed and performance. You can take a notes quickly and browse your archive.
Easy: Notes.io doesn’t require installation. Just write and share note!
Short: Notes.io’s url just 8 character. You’ll get shorten link of your note when you want to share. (Ex: notes.io/q )
Free: Notes.io works for 14 years and has been free since the day it was started.
You immediately create your first note and start sharing with the ones you wish. If you want to contact us, you can use the following communication channels;
Email: [email protected]
Twitter: http://twitter.com/notesio
Instagram: http://instagram.com/notes.io
Facebook: http://facebook.com/notesio
Regards;
Notes.io Team
