Algorithm of creation of a Linked List
CREATE---In this algorithm a Linked List of nodes is created. The list is pointed by pointer first, the last node of the list points to NULL., indicating the end of the list.
Stack is LIFO(LAST IN FIRST OUT) linear data structure. It can have 2 operations 1)Push(add a new item) 2)Pop(delete an item).In this example I have shown how to reverse a string from last character to the first (example…..RAM OUTPUT IS MAR)
Queue Operations are......
1· Enqueue—Add an item(new item in back side) to the end of the queue.
2· Dequeue—Remove an item from the front.
3· Queue Front—Who is first?
4· Queueu End—Who is last?