vinitshahdeo

/*
Author - Vinit Shahdeo
*/
#include<bits/stdc++.h>
using namespace std;
void printNGE(int a[],int n)
{
    stack<int> s;
    map<int,int> m;
    for(int i=0;i<n;i++)

vinitshahdeo

/*
Author - Vinit Shahdeo
Check here - https://code.hackerearth.com/ad6725j
*/
#include <iostream>
using namespace std;
void printArray(int a[],int n)
{
    for(int i=0;i<n;i++)
    cout<<a[i]<<" ";

vinitshahdeo

Node * inOrderSuccessor(Node *root, Node *x)
{
    if(root==NULL)
    return root;
    if(x->right)
    {
        Node* temp=x->right;
        while(temp->left!=NULL)
        temp=temp->left;
        return temp;

vinitshahdeo

Node* findMin(Node* root)
{
    while(root->left!=NULL)
    root=root->left;
    return root;
}
Node * deleteNode(Node *root,  int x)
{
   if(root==NULL)
   return root;