I hereby claim:
- I am mkhy19 on github.
- I am mkhy (https://keybase.io/mkhy) on keybase.
- I have a public key whose fingerprint is D187 19A0 E303 6068 B8C4 A368 7C9F 5AC8 B423 F0EE
To claim this, I am signing this object:
I hereby claim:
To claim this, I am signing this object:
#include <bits/stdc++.h> | |
using namespace std; | |
struct node | |
{ | |
int data; | |
struct node *left; | |
struct node *right; | |
}; |
#include <bits/stdc++.h> | |
using namespace std; | |
/* | |
if we have this tree | |
1 | |
/ \ | |
2 3 | |
/ \ |
I hereby claim:
To claim this, I am signing this object:
//Using Array | |
#include <iostream> | |
using namespace std; | |
// Constants | |
#define max 20 | |
// Functions |
//Using 2 stacks | |
#include<iostream> | |
#include<stack> | |
using namespace std; | |
class myQueue | |
{ | |
private: |
//QUEUE USING LINKED LIST | |
#include <bits/stdc++.h> | |
#include<conio.h> | |
using namespace std; | |
//Create a NODE | |
struct node | |
{ |
#include <bits/stdc++.h> | |
using namespace std; | |
struct node | |
{ | |
int data; | |
node *next; | |
} | |
*front = NULL,*tail = NULL,*Node = NULL,*newNode = NULL; |
#include <bits/stdc++.h> | |
using namespace std; | |
bool isBalanced(string s) | |
{ | |
vector<char> openingBracketsStack; | |
for(int i=0; i<s.size() ;++i) | |
{ |
//Stack using linked list | |
#include<iostream> | |
using namespace std; | |
//Define node pointer | |
struct node | |
{ | |
int data; | |
node* next; |