Program to Sort a Linked List

This program is to sort a Singly Linked List. Time complexity is O(n2) to sort a linked list.

Program to Sort a Linked List


Remove duplicates from an unsorted linked list without using temporary buffer

Write Code to remove duplicates from an unsorted linked list. How would you solve this problem if a temporary buffer is not allowed?

Following program is to remove all duplicate nodes from the linked list, strickly without using any extra data structure or temporary buffer. Language used C#.

Different Types of Graphs and its application (Data Structure)

Graphs, Graph Representation, undirected graph, directed graph, Depth first search, Breadth first search, Spanning tree, Prim’s Algorithm, Kruskal’s Algorithm, Shortest path, Dijkstra’s algorithm, Floyd’s Algorithm, Topological ordering on directed acyclic graphs, Topological ordering algorithm, Warshall’s Algorithm, Hamiltonian Paths, Applications of graphs

program for array implementation of stack, stack through linked list, linked list operations, polynomials as linked list, convert infix to postfix, infix to prefix, queue implementation of array and more

Array implementation of stack, Implementation of stack through link list, Operation on link list, add two polynomials maintained as linked lists, multiply two polynomials maintained as linked lists, convert an Infix form to postfix form, convert an Infix expression to prefix form, implements queue as an array, implements queue as a linked list, implements circular queue as an array