ingbeeni

#include class Circle{private:int rad;public:Circle(int r){rad = r;}double getarea(){return 3.14 * rad * rad;}}; int main(void){Circle a(6),b(7),c(8);std::cout

#include#include #define MAX_QUEUE_SIZE 100 typedef struct TreeNode{int data;struct TreeNode *left, *right;}TreeNode; TreeNode n1={1 , NULL, NULL};TreeNode n2={4 , &n1, NULL};TreeNode n3={16 , NULL, NULL};TreeNode n4={25 , NULL, NULL};TreeNode n5={20 , &n3, &n4};TreeNode n6={15 , &n2, &n5};TreeNode *root=&n6; int get_node_count(TreeNode *root){int count =0;if( root != NULL)count = 1 + get_node_c..

#include#include #define MAX_QUEUE_SIZE 100 typedef struct TreeNode{int data;struct TreeNode *left, *right;}TreeNode;typedef TreeNode *element;typedef struct{element queue[MAX_QUEUE_SIZE];int front, rear;}QueueType; TreeNode n1={1 , NULL, NULL};TreeNode n2={4 , &n1, NULL};TreeNode n3={16 , NULL, NULL};TreeNode n4={25 , NULL, NULL};TreeNode n5={20 , &n3, &n4};TreeNode n6={15 , &n2, &n5};TreeNode ..

#include#include typedef int element;typedef struct node{element data;struct node *left, *right;}Treenode; /*Treenode n1= {1, NULL, NULL};Treenode n2= {4, &n1, NULL};Treenode n3= {16, NULL, NULL};Treenode n4= {25, NULL, NULL};Treenode n5= {20, &n3, &n4};Treenode n6= {15, &n2, &n5};Treenode *root =&n6;*/ void init_node(Treenode *root){root->data = 0;root->left = NULL;root->right =NULL;}void creat..

#include#include #define MAX_NODE_SIZE 10typedef char element; void error(char *message);void insert_node(element *node);void search_node(element *node);void search_children(element *node);void display_node(element *node); int main(void){element NODE[MAX_NODE_SIZE]= {0};//printf("%d",'a'); insert_node(NODE);display_node(NODE);search_node(NODE);//search_children(&NODE); return 0;} void error(char..

#include#include #define MAX_QUEUE_SIZE 6typedef char element;typedef struct{element queue[MAX_QUEUE_SIZE];int front, rear;}QueueType; void error(char *message){fprintf(stderr,"%s\n",message);exit(1);} void init(QueueType *q){q->front = q->rear = 0;} int is_empty(QueueType *q){return (q->front == q->rear);} int is_full(QueueType *q){return ((q->rear+1)%MAX_QUEUE_SIZE == q-> front);} void enqueue..

#include #include typedef int element; typedef struct QueueNode{ element item; struct QueueNode *link; }QueueNode; typedef struct { QueueNode *front,*rear; }QueueType; void error(char *message); void init(QueueType *q); int is_empty(QueueType *q); void enqueue(QueueType *q,element item); element dequeue(QueueType *q); //void display_linked_queue(QueueType *q); int main(void){ QueueType q; init(&..

#include #include #define MAX_QUEUE_SIZE 6 typedef int element; typedef struct{ element queue[MAX_QUEUE_SIZE]; int front,rear; }QueueType; // void init(QueueType *q); int is_empty(QueueType *q); int is_full(QueueType *q); void enqueue(QueueType *q,element item); element dequeue(QueueType *q); void display_queue(QueueType *q); int main(void){ QueueType q; init(&q); enqueue(&q, 1); enqueue(&q, 2);..

#include #include #include #define TRUE 1 #define FALSE 0 #define MAX_STACK_SIZE 100 typedef char element; typedef struct{ element stack[MAX_STACK_SIZE]; int top; }StackType; void init(StackType *s){ s->top = -1; } int is_empty(StackType *s){ return (s->top == -1); } int is_full(StackType *s){ return (s->top == (MAX_STACK_SIZE-1)); } void push(StackType *s,element item){ if( is_full(s)){ fprintf..

#include; #include; #include; #define TRUE 1 #define FALSE 0 #define MAX_STACK_SIZE 100 typedef char element; typedef struct{ element stack[MAX_STACK_SIZE]; int top; }StackType; void init(StackType *s){ s->top = -1; } int is_empty(StackType *s){ return (s->top == -1); } int is_full(StackType *s){ return (s->top == (MAX_STACK_SIZE-1)); } void push(StackType *s,element item){ if( is_full(s)){ fpri..