Programly | Program Simply

#include <stdio.h> int main(void) {     int f=5;     int w=5; for(int i=1;i<=5;i++) {     if(i%2!=0){         for(int h=1;h<=f;h++){             printf("%d",h);         }         f=f-1;         w=w-1;         printf("\n");     }     if(i%2==0){         for(int r=w;r>0;r--)         {             printf("%d",r);         }     w=w-1;     f=f-1;     printf("\n");     } } return 0; } output:- 12345                                                            ...

#include <stdio.h> int main(void) {     int count=1,s=0,k=1; for(int i=1;i<=5;i++){     for(int j=k;j<10;j++)     {if(j%2!=0){         if(count==2)         s=j;         printf("%d",j);         count=count+1;     }     }     count=1;     k=s;     printf("\n"); } return 0; } output:- 13579                                                                                                                             3579       ...

           The main aim of this project is to store the information of movie in Binary Search Tree. In this we should arrange movie database in Binary search tree order, in binary search tree we can add movie record to movie database or can delete record from movie database , we can  search movie record from movie database by actor name, rating , time period , year. The new cast member name also we can add it or we can delete if it present in the binary search tree. In this project we will use the application linked list ADT (doubly linked list)and sorted list ADT(circular linked list),movie database application (linked list, iterator, queue ADT, sorted circular linked list) By the applications of all these finally   the   movies   should   be   in the   Binary   search tree   sorted order. The program can be run properly without any errors. The final output of this project is the movies record in ...