harish-r

/* Binary Search Tree Implementation in C */
/* Harish R */

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

struct TreeNode
{
    int data;
    struct TreeNode* left;

harish-r

/* 
** Binary Search Tree implementation in C++
** Harish R
*/
#include<iostream>
using namespace std;

class BST {
    
    struct node {

harish-r

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


#include<iostream>

using namespace std;

class BST
{

harish-r

// Linked List CPP
#include<iostream>

using namespace std;

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

harish-r

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

using namespace std;

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

harish-r

#!/bin/bash
sudo su
cd ~
mkdir gcc_all && cd gcc_all
#
curl -L https://ftpmirror.gnu.org/gcc/gcc-9.1.0/gcc-9.1.0.tar.xz | tar xf -
#
curl -L ftp://gcc.gnu.org/pub/gcc/infrastructure/gmp-6.1.0.tar.bz2 | tar xf -
curl -L ftp://gcc.gnu.org/pub/gcc/infrastructure/mpfr-3.1.4.tar.bz2 | tar xf -
curl -L ftp://gcc.gnu.org/pub/gcc/infrastructure/mpc-1.0.3.tar.gz | tar xf -

harish-r

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

#include<iostream>

using namespace std;

harish-r

#include<iostream>
#define MAX 5

using namespace std;

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

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)

harish-r

" ################## Vim Plug Begin ##################
call plug#begin('~/.vim/plugged')
Plug 'dracula/vim', { 'as': 'dracula' }
Plug 'vim-airline/vim-airline'
Plug 'vim-airline/vim-airline-themes'
Plug 'junegunn/fzf', { 'dir': '~/.fzf', 'do': './install --all' }
Plug 'junegunn/fzf.vim'
Plug 'scrooloose/nerdtree'
call plug#end()
" ################## Vim Plug End ####################