devil-cyber

devil-cyber

#include<stdio.h>
#include<stdlib.h>
#define INT_MIN -999999

struct Queue{
    unsigned int capacity;
    int *arr;
    int front;
    int top;
    int size;

devil-cyber

#include<stdio.h>
#include<stdlib.h>
#define INT_MIN -99999999

struct stack{
    int top;
    unsigned int capacity;
    int * arr;
};

devil-cyber

#include<stdio.h>
#include<stdlib.h>

struct Node{
    int data;
    struct Node *next;
};

struct Node *NewNode(int data){
    struct Node *node = (struct Node*)malloc(sizeof(struct Node));

devil-cyber

#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#define MAX(X,Y) ((X) > (Y) ? (X) : (Y))
#define MIN(X,Y) ((X) > (Y) ? (Y) : (X))

struct Node{
    int data;
    struct Node *left;
    struct Node *right;

devil-cyber

{"lastUpload":"2022-01-10T19:56:28.451Z","extensionVersion":"v3.4.3"}

devil-cyber

#include<iostream>
#include<vector>
#include<queue>
using namespace std;

class Graph{
    int V;
    vector<int> *l;
public:
    Graph(int v){

devil-cyber

#include<iostream>
#include<vector>
using namespace std;

class Graph{
    int V;
    vector<int> *l;
public:
    Graph(int v){
        V = v;

devil-cyber

#include<iostream>
#include<vector>
using namespace std;

class Graph{
    int V;
    vector<int> *l;
public:
    Graph(int v){
        V = v;

devil-cyber

#include<iostream>
#include<list>
#include<vector>
using namespace std;

class Graph{
    int V;
    list<int> *l;
public:
    Graph(int v){