# DATA STRUCTURES - C Plus Plus Codes

## Floyd Warshall Algorithm

* Description This program shows the implementation of Floyd Warshall Shortest Path Algorithm. Source Code
#include<iostream.h>
#include<conio.h>
#include<stdio.h>
#include<stdlib. ...*

*Sep 1, 2008*

## Queue ADT Using Single Linked Lists

* Description C++ program to implement Queue ADT using Single linked lists. Source Code
//program to implement Queue ADT using linked lists
#include<iostream.h>
#include<conio.h>
#include&l ...*

*Aug 9, 2010*

## AVL Tree

* Description This program shows all possible Operations on an AVL Tree Source Code /* Adelson Velseky Landis Tree */
# include <iostream.h>
# include <stdlib.h>
# include <conio.h>
...*

*Sep 1, 2008*

## Enqueue & Dequeue

* Description this is a Code which is used to Create a Queue,Enqueue an element in a Queue,Dequeue an element from a Queue,to display the member elements of a Queue & to display the Size of the Queue. Source Code <pre name="code" class ...*

*Aug 17, 2008*

## Bubble Sort

* Description This is a Code which sorts a given set of numbers by using Bubble Sort algorithm Source Code #include <stdio.h>
#include <iostream.h>
#include<conio.h>
//Bubble sort functio ...*

*Aug 17, 2008*

## Link List Operations

* Description This is a Code which creates a Link List,enters a new Node into a Link List,Deletes an already existin Node from the Link List from any position in the Link List & can print the Members of the list. Source Code <pre name= ...*

*Aug 17, 2008*

## Heap Sort

* Description This is a Code to implement the HeapSort Algorithm for a given set of numbers. Source Code #include <iostream.h>
#include <conio.h>
int heapSize = 10;
void print(int a[])
{
for ( ...*

*Aug 17, 2008*

## Towers of Hanoi

* Description This is a Code to implement the Towers of Hanoi problem using C++. Source Code #include <iostream.h>
// a disk with a value , which is an element of the stack ,tower in this cas ...*

*Aug 17, 2008*

## Bucket Sort

* Description This Code implements the Bucket Sort algorithn using C++ to sort a given set of numbers. Source Code #include <iostream.h>
class element //element
{
public:
int value;
element *nex ...*

*Aug 17, 2008*

## Shanon Fano

* Description Using Shannon's algorithm for code assignment to characters of varying probabilities. Source Code #include<stdio.h>
#include<conio.h>
#include<math.h>
int temp,i,j,col=0,n ...*

*Aug 29, 2008*

## Insertion Sort

* Description This is a Code which is used to sort a given set of numbers using Insertion Sort Algorithm. Source Code #include <iostream.h>
#include <conio.h>
void sort(int * a)
{
for (int j ...*

*Aug 17, 2008*

## Selection Sort

* Description This is a Code to implement the Selection Sort Algorithnm for a given set of numbers. Source Code #include <iostream.h>
void selectionSort(int *array,int length) //selection sort funct ...*

*Aug 17, 2008*

## BST - Binary Search Tree

* Description Binary search tree program Source Code //BINARY SEARCH TREE
#include "stdio.h"
#include "conio.h"
#include"malloc.h"
#include"stdlib.h"
typedef str ...*

*Jul 2, 2011*

## Circular Queue

* Description This is a Program for Circular Queue Implementation using Arrays. Source Code
#include<iostream.h>
#include<conio.h>
const int MAX = 5;
class cqueue
{
...*

*Aug 31, 2008*

## Queue Implementation using Linked List

* Description This program takes the Name,Age & Height of a person in a Queue and does all related operations Source Code #include <iostream.h>
#include <conio.h>
#include <stdlib.h>
...*

*Aug 26, 2008*

## Binary Tree

* Description This is a simple program illustrating all operations on a Binary Tree Source Code /* Binary tree implementation in CPP */
/* --------------------------------- */
#include <iostream.h& ...*

*Aug 26, 2008*

## Merge Sort

* Description This is a Code which implements MergeSort Algorithm to sort a given set of numbers. Source Code #include <iostream.h>
#include <conio.h>
#include <stdio.h>
void print(int * ...*

*Aug 17, 2008*

## Stack Implementation

* Description This is a simple code which describes the basic stack implementation like push, pop etc.... Source Code # include<iostream.h>
# include<process.h>
# include<conio.h>
# define ...*

*Aug 23, 2008*

## Merging Link Lists

* Description This is a code which merges two Sorted Link Lists to form a third Link List. Source Code
#include<iostream.h>
#include<conio.h>
#include<process.h>
// Creating a N ...*

*Aug 31, 2008*

## Doubly Circular Linked List

* Description This is a program which implements Doubly Circular Linked List. Source Code #include<iostream.h>
#include<conio.h>
class cirdlink
{
struct node
{
int data;
...*

*Aug 31, 2008*

## Quick Sort

* Description How quick sort work.. Source Code #include <stdio.h>
#include <stdlib.h>
#include <limits.h>
typedef int T; /* type of item to be sorted */
#define MAXSTACK ...*

*Jun 23, 2011*