LINK LIST

 

1. Insert element  at the front. -algorithm

2. Insert element  at the end. -algorithm

3. Insert element  at any position. -algorithm

4. Delete element  from the front. -algorithm

5. Delete element  from the end. -algorithm

6. Delete element  from any position-algorithm

7. Count Node-Algorithm

8. Advantages And Disadvantages

9. Comapre with array

 

doubly link list

1. Insert element  at the front. -algorithm

2. Insert element  at the end. -algorithm

3. Insert element  at any position. -algorithm

4. Delete element  from the front. -algorithm

5. Delete element  from the end. -algorithm

6. Delete element  from any position-algorithm

7. Swap Two Adjacent Element-Algorithm

 

Circular Link List

1. Insert Element  At The Front. -Algorithm

2. Insert Element  At The End. -Algorithm

3. Insert Element  At Any Position. -Algorithm

4. Delete Element  From The Front. -Algorithm

5. Delete Element  From The End. -Algorithm

6. Delete Element  From Any Position-Algorithm

 

 

Stack Using Link List-Algorithm

Queue Using Link List-Algorithm

Sparse Matrix Using Link List

Polynomial Using Link List

Polynomial Add, Subtract, Multiplication -Algorithm