harish-r

/* AVL Tree Implementation in C++   */
/* Harish R                         */


#include<iostream>

using namespace std;

class BST
{

harish-r

// Queue - Linked List Implementation
#include<iostream>

using namespace std;

class Node
{
public:
    int data;
    Node *next;

harish-r

#include<iostream>
#define MAX 5

using namespace std;

class Queue
{
    public:
    int front, rear;
    int queue_array[MAX];

harish-r

/* Stack - Array Implementation */
/* Language: C++                */
/* Created By: Harish R         */

#include<iostream>
#define MAX 10

using namespace std;

class Stack

harish-r

// Linked List CPP
#include<iostream>

using namespace std;

class Node
{
public:
    int data;
    Node *next;

harish-r

/*
* Quick Sort Algorithm
* Language: C++
* Created by: Harish R
*/

#include<iostream>

using namespace std;

harish-r

/*
* Merge Sort Algorithm
* Language: C++
* Created by: Harish R
*/

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

void merge(int *a, int *l, int nL, int *r, int nR)