Use class C to write an inverse algorithm (data structure) of a circular doubly linked list.

ailestrike

Use C class to write an inverse algorithm for a circular double linked list (data structure)

micheal335

Data structure standard practice. All are pushed onto the stack and all are pushed off the stack

wsnhgf

struct Node
{
  struct Node * left;
  struct Node * right;
};

void travel (struct Node * head)
{
while (traversing the linked list)
{
  // swap the left and right of the current node
}
}