Input Tree (C++)

 

#include<iostream.h>
#include<conio.h>
#include<stdio.h>
#include<stdlib.h>
struct node
{
int data;
node *left;
node *right;
};

node *tree=NULL;
node *insert(node *tree,int ele);

void preorder(node *tree);
void inorder(node *tree);
void postorder(node *tree);
int count=1;

void main()
{
clrscr();
int ch,ele;
do
{
clrscr();
cout<<”\n\t\a\a1-> INSERT A NODE IN A BINARY TREE.\a\a”;
cout<<”\n\t\a\a2-> PRE-ORDER TRAVERSAL.\a\a”;
cout<<”\n\t\a\a3-> IN-ORDER TRAVERSAL.\a\a”;
cout<<”\n\t\a\a4-> POST-ORDER TRAVERSAL.\a\a”;
cout<<”\n\t\a\a5-> EXIT.\a\a”;
cout<<”\n\t\a\aENTER CHOICE :\a\a”;
cin>>ch;

Queue (Antrian) C++

 

#include<stdio.h>
#include<conio.h>

#define MAX 8
typedef struct{
int data[MAX];
int head;
int tail;
}
Queue;

Queue antrian;
void Create(){
antrian.head=antrian.tail=-1;
}
int IsEmpty(){
if (antrian.tail==-1)
return 1;
else
return 0;
}
int IsFull(){
if(antrian.tail==MAX-1) return 1;
else return 0;
}

void Enqueue(int data){
if(IsEmpty()==1){
antrian.head=antrian.tail=0;
antrian.data[antrian.tail]=data;
printf(“%d masuk!!”, antrian.data[antrian.tail]);
}else
if(IsFull()==0){
antrian.tail++;
antrian.data[antrian.tail]=data;
printf(“%d masuk!”, antrian.data[antrian.tail]);
}