Home > Source Codes > Software Programs > C++ Programs

C++ program to implement stack using Linked List

Thursday, February 3rd, 2011  »  Posted By  »  Total 1 Comment

#include <iostream.h> template<class T> class Node { friend LinkedStack<T>; private: T data; Node<T> *link; }; template<class T> class LinkedStack { public: LinkedStack() {top = 0;} ~LinkedStack(); int IsEmpty() const {return top == 0;} T Top() const; LinkedStack<T>& Add(const T& x); LinkedStack<T>& Delete(T& x); private: Node<T> *top; }; template<class T> LinkedStack<T>::~LinkedStack() {// Stack destructor.. Node<T> *next; [...]

C++ program to implement Stack using Formula Based Representation

Thursday, February 3rd, 2011  »  Posted By  »  Total 1 Comment

#include<iostream.h> #include<constream.h> template<class T> class Stack { public: Stack(int MaxStackSize); ~Stack(){delete[] S;} int IsEmpty()const{return top==-1;} int IsFull()const{return top==MaxTop;} T Peek()const; void Push(T); T Pop(); void Display(); private: int top; //current top of stack int MaxTop; //max val for top T *S; //element array }; template<class T> Stack<T>::Stack(int MaxStackSize) { //stack constructor MaxTop=MaxStackSize-1; S=new T[MaxStackSize]; top=-1; [...]

C++ program to multiply two polynomials maintained as linked lists

Thursday, February 3rd, 2011  »  Posted By  »  Total 2 Comments

#include <iostream.h> class poly { private : struct polynode { float coeff ; int exp ; polynode *link ; } *p ; public : poly( ) ; void poly_append ( float c, int e ) ; void display_poly( ) ; void poly_multiply ( poly &p1, poly &p2 ) ; void padd ( float c, int [...]

C++ program to add two polynomials maintained using Linked Lists

Thursday, February 3rd, 2011  »  Posted By  »  Total 3 Comments

#include <iostream.h> class poly { private : struct polynode { float coeff ; int exp ; polynode *link ; } *p ; public : poly( ) ; void poly_append ( float c, int e ) ; void display_poly( ) ; void poly_add( poly &l1, poly &l2 ) ; ~poly( ) ; } ; poly :: [...]

C++ program to implement B-Trees

Wednesday, February 2nd, 2011  »  Posted By  »  Total 9 Comments

#include <iostream.h> #include <stdlib.h> #include <alloc.h> const int MAX = 4 ; const int MIN = 2 ; struct btnode { int count ; int value[MAX + 1] ; btnode *child[MAX + 1] ; } ; class btree { private : btnode *root ; public : btree( ) ; void insert ( int val ) [...]

C++ program to implement AVL Tree & its Operations

Wednesday, February 2nd, 2011  »  Posted By  »  Total 3 Comments

#include <iostream.h> #include <stdlib.h> #include<constream.h> #define FALSE 0 #define TRUE 1 struct AVLNode { int data ; int balfact ; AVLNode *left ; AVLNode *right ; } ;   class avltree { private : AVLNode *root ; public : avltree( ) ; AVLNode* insert ( int data, int *h ) ; static AVLNode* buildtree ( [...]

C++ program to implement Binary Search Tree(BST) and its Operations

Wednesday, February 2nd, 2011  »  Posted By  »  Total 0 Comment

#include <iostream.h> class btree { private : struct node { node *left ; char data ; node *right ; } *root ; char *arr ; int *lc ; int *rc ; public : btree ( char *a, int *l, int *r, int size ) ; void insert ( int index ) ; static node* buildtree [...]

C++ program for creation and traversal of a Binary Tree

Wednesday, February 2nd, 2011  »  Posted By  »  Total 5 Comments

#include<iostream.h> #include<conio.h> #include<process.h> struct tree_node { tree_node *left; tree_node *right; int data; } ; class bst { tree_node *root; public: bst() { root=NULL; } int isempty() { return(root==NULL); } void insert(int item); void inordertrav(); void inorder(tree_node *); void postordertrav(); void postorder(tree_node *); void preordertrav(); void preorder(tree_node *); }; void bst::insert(int item) { tree_node *p=new tree_node; [...]

C++ program to implement circular queue using array

Wednesday, February 2nd, 2011  »  Posted By  »  Total 1 Comment

#include <iostream.h> class cqueue { private : int *arr ; int front, rear ; int MAX; public : cqueue( int maxsize = 10 ) ; void addq ( int item ) ; int delq( ) ; void display( ) ; } ; cqueue :: cqueue( int maxsize ) { MAX = maxsize ; arr = [...]

C++ program to implement Heap sort Algorithm

Tuesday, February 1st, 2011  »  Posted By  »  Total 4 Comments

#include <iostream.h> const int MAX = 10 ; class array { private : int arr[MAX] ; int count ; public : array( ) ; void add ( int num ) ; void makeheap(int ) ; void heapsort( ) ; void display( ) ; } ; array :: array( ) { count = 0 ; for [...]

Pages:1234567»
Question and Answer
C/C++ Unix & Linux Wordpress
Source codes
C C++ Java

Free email signup