S

@sreebhavani_2325

BST level order traversal

C
1 year ago
#include<stdio.h> #include<stdlib.h> #define MALLOC(p,n,type)\ p=(type*)malloc(n*sizeof(type));\ if(p==NULL)\ {\ printf("insufficient memory\n");\ exit(0); \ }

BST traversals

C
1 year ago
#include <stdio.h> #include <stdlib.h> #define MALLOC(p, n, type) \ p = (type *)malloc(n * sizeof(type)); \ if (p == NULL) \ { \ printf("Insufficient memory\n"); \ exit(0); \ }

BST operations-hyt max min count

C
1 year ago
#include <stdio.h> #include <stdlib.h> #define MALLOC(p, n, type) \ p = (type *)malloc(n * sizeof(type)); \ if (p == NULL) \ { \ printf("Insufficient memory\n"); \ exit(0); \ }

BST-create delete display search

C
1 year ago
#include <stdio.h> #include <stdlib.h> #define MALLOC(p,n,type) \ p = (type*)malloc(n * sizeof(type)); \ if (p == NULL) {\ printf("insufficient memory\n"); \ exit(0); \ }

balanced parenthesis

C
1 year ago
#include<stdio.h> #include<string.h> int isMatchingPair(char character1, char character2) { if (character1 == '(' && character2 == ')') return 1; else if (character1 == '{' && character2 == '}') return 1; else if (charac

evaluation of postfix

C
1 year ago
#include<stdio.h> #include<ctype.h> #include<stdlib.h> #define max 100 float st[max]; int top=-1; void push(float st[],float val) { if(top==max-1) {

infix to postfix

C
1 year ago
#include<stdio.h> #include<stdlib.h> #include<ctype.h> #include<string.h> #define MAX 20 void push(char op); char pop(); int Priority(char op); void Conversion(char infix[]); char stack[MAX];

MongoDB Fundamentals

MongoDB
2 years ago
//INTRO db.students.insertMany([ { id: 1, name: 'Ryan', gender: 'M', info: {hasliscense : true, hascar:false} }, { id: 2, name: 'Joanna', gender: 'F',info: {hasliscense : false, hascar:false}}, { id: 3, name:'Tom', gender:'M', info: {haslisce