Question

WAP to implement double circular linked list where every node will keep the address of next and previous node. First node previous part will keep the address of last node and last node next part will keep the address of first node. But instead of start you have to keep a special variable called as last, which will keep the address of last node. 1. Create a list 2. Insert at beginning 3. Insert at end 4. Delete from beginning 5. Delete from end 6. Apply bubble sort to sort the elements of list Perform all above operations.​

Answer 1

Answer:

are khena kya chahte ho

Explanation:

what am I supposed to do with this???

Answer 2

Answer:

chhfhjjhrhntnsjjnthdhejjrhdhshabqbehusbbenakmwebsbannebbnnebfbbsbebgegsbbwbeh

Explanation:

bbebbebsbaabbvfvddbd