this-mkhy

Keybase proof

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:

this-mkhy

#include <bits/stdc++.h>

using namespace std;

struct node
{
    int data;
    struct node *left;
    struct node *right;
};

this-mkhy

#include <bits/stdc++.h>

using namespace std;

/*
if we have this tree
     1
    / \
   2   3
  / \

this-mkhy

Keybase proof

I hereby claim:

• I am mohamedkhaledyousef 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:

this-mkhy

//Using Array

#include <iostream>

using namespace std;

// Constants
#define max 20

// Functions

this-mkhy

//Using 2 stacks

#include<iostream>
#include<stack>

using namespace std;

class myQueue
{
    private:

this-mkhy

//QUEUE USING LINKED LIST

#include <bits/stdc++.h>
#include<conio.h>

using namespace std;

//Create a NODE
struct node
{

this-mkhy

#include <bits/stdc++.h>

using namespace std;
struct node
{
    int data;
    node *next;
}
*front = NULL,*tail = NULL,*Node = NULL,*newNode = NULL;

this-mkhy

#include <bits/stdc++.h>

using namespace std;

bool isBalanced(string s) 
{
    vector<char> openingBracketsStack; 
    
    for(int i=0; i<s.size() ;++i) 
    {

this-mkhy

//Stack using linked list
#include<iostream>

using namespace std;

//Define node pointer
struct node
{
    int data;
    node* next;