Algorithm to add element in the end of circular linked list, Data Structure & Algorithms

Assignment Help:

Q. Write down an algorithm to add an element in the end of the circular linked list.

Ans.

Algorithm to Add the Element at the End of Circular Linked Lists written below.

IINSENDCLL( INFO, LINK, START, AVAIL, ITEM) The algorithm deletes last element from the circular linked list.

1. [OVERFLOW?] if AVAIL = NULL, then Write:

OVERFLOW, and Exit.

2. [Remove first node from the AVAIL: = LIN[AVAIL].

a. Set NEW:= AVAIL and AVAIL:=LINK[AVAIL].

3. Set INFO[NEW]:=ITEM. [copies new data into new node.]

4. Set PTR:= LINK[START] and SAVE:=START.[initializes popinters]

5. Repeat while LINK[PTR]!=START: [ Traverses list seeking last node.]

a. Set PTR:=LINK[PTR]. [Updates PTR] [ End of loop]

6. Set LINK [PTR]:= NEW. [ Attaches new node to the last node of the list]

7. Set LINK[NEW]:= START [ New node now points to the original first node.]

8. Exit

Related Discussions:- Algorithm to add element in the end of circular linked list

Binary search tree, A binary search tree (BST), which may sometimes also be...

A binary search tree (BST), which may sometimes also be named a sorted or ordered binary tree, is an edge based binary tree data structure which has the following functionalities:

Write the algorithm to find input and output value, This algorithm inputs 5...

This algorithm inputs 5 values and outputs how many input numbers were positive and how many were negative. Data to be used: N = 1, -5, 2, -8, -7

Determine about the post conditions assertion, Determine about the Post con...

Determine about the Post conditions assertion A post condition is an assertion which should be true at completion of an operation. For instance, a post condition of the squ

Representing sparse matrix in memory using array, Q. What do you understand...

Q. What do you understand by the term sparse matrix? How sparse matrix is stored in the memory of a computer? Write down the function to find out the transpose of a sparse matrix u

Queue, algorithm for insertion in a queue using pointers

algorithm for insertion in a queue using pointers

Insertion of an element in a linear array, To delete an element in the list...

To delete an element in the list at the end, we can delete it without any difficult. But, assume if we desire to delete the element at the straining or middle of the list, then, we

Define dynamic programming, Define Dynamic Programming Dynamic progra...

Define Dynamic Programming Dynamic programming is a method for solving problems with overlapping problems. Typically, these sub problems arise from a recurrence rel

Implementation of circular queues, One of the main problems with the linear...

One of the main problems with the linear queue is the lack of appropriate utilization of space. Assume that the queue can store 100 elements & the complete queue is full. Thus, it

Curve, write a c++ program to find out the area of a curve y=f(x) between x...

write a c++ program to find out the area of a curve y=f(x) between x=a and x=b

Linked lists, representation of links list in memory

representation of links list in memory

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages