C++ Programming Tutorial

 
 
 

Data File Structure Programs

Array

Insert, edit, delete, append, display, Srch. Insert, delete, merge, delete multiple occurrences Arrays as a Stack in graphics

Stack

Stack operations using array Stack using static memory allocation Stack using dynamic memory allocation Double ended link list as a stack Lnked list as a Stack Infix expr. to Postfix expr. Postfix expr. into an Infix expr. Arrays as a Stack in graphics Stack as an Arithmetic expr. Evaluater Graphical Rep. of Stack Stack to traverse - inodr, postodr, preodr

Queue

Queue using static memory allocation Queue using dynamic memory allocation Circular queue Linked list as a Queue Double Ended linked list as a Queue Graphical Rep. of Queue Arrays as a Linear Queue Array as a Circular Queue Arrays as a Linear Queue ( in graphics ) Arrays as a Circular Queue ( in graphics )

Linked List

Singly link list Circular linked list Doubly link list Linked list as a Queue Linked list as a Stack Double Ended linked list as a Queue Double Ended linked list as a Stack Infix to Postfix - Linked List as Stack Circular doubly link list Single Ended Linked List - Sorting in both odr Hashing - double ended Linked List Sort of link list

Tree

Linked List as a Binary Srch. Tree Set Class using Binary Srch. Tree Maximum depth of Binary Srch. Tree Minimum Spaning Tree Prims algo - minimum spanning tree Traverse binary tree - inodr, preodr, post Find number in binary Srch. tree display levell

Sorting

Bubble Sort Selection Sort Insertion Sort Radix Sort Merge Sort Quick Sort Heap Sort Linear Sort Shell Sort Topological Sort

Searching

Linear Srch. or Sequential Srch. Binary Search Breadth First Search Traversal Depth First Search Traversal Shortest Path-Given Source-Destination-Dijkstras

Hashing

Simple implementation of Hashing Hashing using double-ended Linked List Hashing using Mid-Square Method Example of Hashing n term of the fibonacci series using recursion

Recursion

Factorial of the given number using recursion Mystery of Towers of Hanoi using recursion
 
 
#include<iostream.h>
#include<conio.h>
#include<stdio.h>
struct btree
{
    struct btree *left;
    struct btree *right;
    int no;
};
void postorder(struct btree *trav);
void inorder(struct btree *trav);
void preorder(struct btree *trav);
struct btree * create(struct btree *trav);
main()
{
    struct btree *root=NULL;
    char c;
    clrscr();
    while(1)
    {
        root=create(root);
        cout<<\"Do you want to continue : \";
        cin>>c;
        if(c==\'n\' ||c==\'N\')
            break;
    }
    cout<<endl<<\"Inoder is    : \";inorder(root);
    cout<<endl<<\"Preorder is  : \";preorder(root);
    cout<<endl<<\"Postorder is : \";postorder(root);
    getch();
}
struct btree * create(struct btree *trav)
{
    if(trav==NULL)
    {
        trav=new btree;
        trav->right=NULL;
        trav->left=NULL;
        cout<<\"Enter the no : \";
        cin>>trav->no;
        return(trav);
    }
    char choice;
    cout<<\"Enter the left or right child : \";
    cin>>choice;
    if(choice == \'r\' || choice == \'R\')
    {
        trav->right=create(trav->right);
    }
    if(choice==\'l\' || choice==\'L\')
    {
        trav->left=create(trav->left);
    }
    return(trav);
}
void inorder(struct btree *trav)
{
    if(trav==NULL)
        return ;
    inorder(trav->left);
    cout<<\" \"<<trav->no;
    inorder(trav->right);
}
void preorder(struct btree *trav)
{
    if(trav==NULL)
        return;
    cout<<\" \"<<trav->no;
    preorder(trav->left);
    preorder(trav->right);
}
void postorder(struct btree *trav)
{
    if(trav==NULL)
        return;
    postorder(trav->left);
    postorder(trav->right);
    cout<<\" \"<<trav->no;
}

    Related Post:
  1. Mini Project School Management Application

  2. Program to implement the Kurskals Algorithm to solve Minimum Cost Spanning Tree Problem (MST) using Graphics

  3. Program that reads an expression consisting of two non-negative integer and an operator. Determine if either integer or the result of the expres......

  4. Program to read a Non-Linear equation in one variable, then evaluate it using Bisection Method and display its kD accurate root

  5. Program to show the implementation of Liang-Barsky Line Clipping Algorithm

  6. Program to print, read and calculate sum, smallest, largest element an array using pointers

  7. Program to illustrate template classes

  8. Program to show the projection of 3D objects using Standard Perspective Projection

  9. Program of scanfill algorithm

  10. Program for Fahrenheit to Celcius using Class

  11. Program to find largest integer among the three and display it using function with return type

  12. Program to perform array operations like append, insert, delete, edit, display and search and element

  13. Program to illustrate the multi-level inheritance

  14. Program that provides an example of inheritance using private data

  15. Program to convert an Infix Expression into a Postfix Expression using Linked List as a Stack

  16. Program to illusrate the use of stream insertion and extraction operators

  17. Program simulate the working of Pre-Processor

  18. Program to illustrate the implementation of Scaling Transformation along a Fixed Point

  19. School management system

  20. Program to implement the Prims Algorithm to solve Minimum Spanning Tree Problem (MST)

 
 
Didn't find what you were looking for? Find more on Program of traversing a binary tree in inorder, preorder and postorder fashion