ḰnowⱣroÍnsight | A perfect portal for you

Traversal of a binary tree is to access every node of binary tree at most once. Breadth First :- ·         Level order Depth First :-                   Pre order                    In order                  Post order Pre order :- <root>   <left>   <right> In order :- <left>   <root>   <right> Post order:- <left>   <right>   <root> Pre order  algorithm 1)visit root 2)visit left subtree 3)visit right subtree typedef   struct   node { char data; node *left; node *right; }node; void preorder(node *root) { if(root==NULL) return 1 ; printf(“%c”,root->data); preorder(root->data); preoder(root->right); } void   inorder(node *root...

Show the status of the queue after every operation :-                       1)       Insert   5 Element                          2)  Delete 2 Element #include<stdio.h> #include<conio.h> #define MAX 10 typedef struct Q {     int R,F;     int data[MAX]; }Q; void initialize(Q*p); int empty(Q *p); int full(Q *p); void enqueue(Q *p,int x); int dequeue(Q *p); void print(Q *p); void main() {     Q q;     int i,x;     initialize(&q);     printf("\n Enter 5 element:");     for(i=1;i<=5;i++)     {         scanf("%d",&x);         if(!full(&q))     ...