Notes

#include stellb.ho

struct Node

int data;

struct Node *next;

To create email addı prepinsta and terms

struct Node *prev:

vold insertStart (struct Node head, int data)

// creating memory for heslinde

struct Node *newNode (struct Node) malloc (street (struct Node)

// assigning nimflode's next as the current head

// Assign dato & and nuke newNode's press Wutt

newNode->data data;

newNode->nest head newNode->prev= NULL;

// if list already had ftes()

// We need to make corrent head previous node as this new node

17 (head I NULL)

(*head)->prev = newNode;

change head to this seallate

head newNode:

void insertlast (struct Node head, data)

struct Node *newNode = (struct Node*) malloc (sizeof (stract Node)

newflode->data data;

newNode->next = NULL;

//need this if there node present in Sinked list at all-

(head NULL)

head newNode; newllode->prev NULL: return;

struct Node temp head;

// traverse till the lost, node while (temp->next - NULL)

tera temp->next;

// assign last hoce's hext to this new lode temp-ext newNode:

// assign this new Rode's previous to last node (teep) newNode->prev-temp;

vote display (struct Node "node)

struct Node ends printf(in Forward Directianon"); white (node 1 NULL)

printf (node->data); eit node: node node->next;

printf (in Backward strection while (end 1- NULL)

printf(">data); end end->prev

lat main ()

struct Node *head MULL

// Neot's aldress we need to change head insertStart (&head, 1); insertStart (head, 2); InsertStart (&head, 3);

InsertLast (shead, 10);

insertlast (&head, 20);

// no need for '' as head need not be changes

// enty doting traversal