LINKED LIST EXAMPLE : INSERTION (BEG | END)

Here is how we add element into a linked list at beginning AND end. Read complete article to view more.

INSERTION AFTER A NODE : LINKED LIST

Click on view more for examples :-

Linked List : Linked List is used to define a array in a memory where defragmentation occurs. Defragment leads to the memory location having non-continous data, so that we cant initialize a large memory location. Linked List is the solution to overcome memory defragment problem in which, we have nodes which contains an info part and a link part.

TOWER OF HANOI : FLASH

It consists of three pegs A, B, and C. Initially peg A has on it some number of disks, starting with the largest one on the bottom and successively smaller ones on top, as shown in Fig. 10.1. The object of the puzzle is to move the disks one at a time from peg to peg, never placing a larger disk on top of a smaller one, eventually ending with all disks on peg B.

AVL TREE FLASH

Adelson-Velskii and Landis’ tree is a self balancing binary tree. To view example of AVL TREE click on read more.

Press any number on flash and press INSERT button to insert that number into AVL TREE, You can perform other operations as deletion, traversing in three orders etc.
From option menu change the balancing option and make use of a simple tree as well.
KEEP CODING 🙂