struct node
{
int data;
struct node *left,*right;
};

void create(struct node **p,int d)
{
if(*p==NULL)
{
*p=(struct node *)malloc(sizeof(struct node));
(*p)->data=d;
(*p)->left=NULL;
(*p)->right=NULL;
}
else
{
if(d<(*p)->data)
{
create(&((*p)->left),d);
}
else
{
create(&((*p)->right),d);
}
}
}

void preorder(struct node *p)
{
if(p!=NULL)
{
printf("\n%d",p->data);
preorder(p->left);
preorder(p->right);
}
}

void postorder(struct node *p)
{
if(p!=NULL)
{
postorder(p->left);
postorder(p->right);
printf("\n%d",p->data);
}
}

void copy(struct node *rt,struct node **p)
{
if(rt!=NULL)
{
*p=(struct node *)malloc(sizeof(struct node));
(*p)->data=rt->data;
(*p)->left=rt->left;
(*p)->right=rt->right;
copy(rt->left,&((*p)->left));
copy(rt->right,&((*p)->right));
}
}

void main()
{
struct node *first=NULL;
int ch,d;
do
{
printf("\nenter your choice:\n");
printf("1.create binary tree\n2.preorder\n3.postorder\n4.exit\n");
scanf("%d",&ch);
switch(ch)
{
case 1: printf("\nenter data:");
scanf("%d",&d);
create(&first,d);
break;

case 2: preorder(first);
break;

case 3: postorder(first);
break;
}
}
while(ch!=4);
}

void main()
{
int a;
printf("Enter your number: ");
scanf("%d",&a);

if(a%2 == 0)

{
printf("Number is Even");
}

else
{
printf("Number is ODD");
}

getch();

if (((year%4==0) && (year%100!=0))||(year%400==0))

void main()
{
int OldNum, NewNum, FibNum, MaxNum;
printf("Generate Fibonacci Numbers till what number? ");
scanf("%d", &MaxNum);

OldNum=0;
NewNum=1;
FibNum = OldNum + NewNum;

printf("%d, %d, %d, ", OldNum, NewNum, FibNum);

for(;;)
{
OldNum = NewNum;
NewNum = FibNum;
FibNum = OldNum + NewNum;
if(FibNum > MaxNum)
{
printf("");
exit(1);
}
printf("%d, ", FibNum);
}
}