#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;
switch(ch)
{
case 1:
cout<<”\n\t\a\aENTER THE ELEMENT :\a\a”;
cin>>ele;
tree=insert(tree,ele);
break;

case 2:
cout<<”\n\t\a\a****PRE-ORDER TRAVERSAL OF A TREE : \a\a”;
preorder(tree);
break;

case 3:
cout<<”\n\t\a\a****IN-ORDER TRAVERSAL OF A TREE : \a\a”;
inorder(tree);
break;

case 4:
cout<<”\n\t\a\a****POST-ORDER TRAVERSAL OF A TREE : \a\a”;
postorder(tree);
break;

case 5:
exit(0);
}
}while(ch!=5);
}

node *insert(node *tree,int ele)
{
if(tree==NULL)
{
tree=new node;
tree->left=tree->right=NULL;
tree->data=ele;
count++;
}
else
if(count%2==0)
tree->left=insert(tree->left,ele);
else
tree->right=insert(tree->right,ele);
return(tree);
}

void preorder(node *tree)
{
if(tree!=NULL)
{
cout<< tree -> data;
preorder(tree->left);
preorder(tree->right);
getch();
}
}

void inorder(node *tree)
{
if(tree!=NULL)
{
inorder(tree->left);
cout<<tree -> data;
inorder(tree->right);
getch();
}
}

void postorder(node *tree)
{
if(tree!=NULL)
{
postorder(tree->left);
postorder(tree->right);
cout<<tree -> data;
getch();
}
}

#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]);
}
}
int Dequeue(){
int i;
int e = antrian.data[antrian.head];
for(i = antrian.head;i<=antrian.tail-1;i++){
antrian.data[i] = antrian.data[i+1];
}
antrian.tail–;
return e;
}
void Clear(){
antrian.head=antrian.tail=-1;
printf(“data clear”);
}
void Tampil(){
if(IsEmpty()==0){
for(int i=antrian.head;i<=antrian.tail;i++){
printf(“%d “, antrian.data[i]);
}
}else printf(“Data kosong!\n”);
}
void main(){
int pil;
int data;
Create();
do{
clrscr();
printf(“1. Enqueue\n”);
printf(“2. Dequeue\n”);
printf(“3. Tampil\n”);
printf(“4. Clear\n”);
printf(“5. Exit\n”);
printf(“Pilih : “);scanf(“%d”,&pil);
switch(pil){
case 1: printf(“Data : “);scanf(“%d”,&data);
Enqueue(data);
break;
case 2: printf(“Elemen yang keluar : %d”, Dequeue());
break;
case 3:
Tampil();
break;
case 4:
Clear();
break;
}
getch();
} while(pil!=5);
}