Insertion Algorithms

Insertion Algorithms:

(a)  Checking to see if space is available in the AVAIL list.  If not, that is, if AVAIL = NULL, then the algorithm will print the message OVERFLOW.

(b)  Removing the first node from the AVAIL list.Using the variable NEW to keep track of the location of the new node, the step can be implemented by the pair of assignments

NEW : = AVAIL,      AVAIL : = LINK[AVAIL]

(c)  Copying new information into the new node.

                                  INFO[NEW] : = ITEM

If You want to learn about the technology, computer science & engineering, web programming, freelancing, earning please click here :CSE SOLVE