rajivseelam

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


/*********************** TREE ************************/
typedef struct _tnode{
    int value;
    struct _tnode *left;
    struct _tnode *right;
} tnode;

rajivseelam

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

/*********
In this program we store the parent of the node too.
We go from node to find the corresponding parent.
***************/

/*********************** TREE ************************/
typedef struct _tnode{

rajivseelam

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


/*********************** TREE ************************/
typedef struct _tnode{
    int value;
    struct _tnode *left;
    struct _tnode *right;
} tnode;

rajivseelam

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

#define MaxData (32767)

typedef struct _bheap{

    int Capacity;
    int Size;
    int *Elements;

rajivseelam

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

typedef struct _node{
    int value;
    struct _node * next;
} node;

typedef node linkedlist;

rajivseelam

/***
This program is similar to reversing a linked list. I have done anyway for the heck of it!
****/

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

typedef struct _node {
    int value;
    struct _node * next;

rajivseelam

Launch the instance and connect with ssh.

##Update the server

sudo yum update

##Install php and MySQL packages

rajivseelam

#include<stdio.h>

int main(){

int numberOfProblems, problemThatCanBeSolved = 0, countOfPeople;
char line[1024];
char * str;

scanf("%d",&numberOfProblems);

rajivseelam

#include<stdio.h>

void swap(char **s, int low, int high){

 char temp;
 temp = (*s)[low];
 (*s)[low] = (*s)[high];
 (*s)[high] = temp;
  
 // printf("%s\n",*s);

rajivseelam

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

typedef struct _node{
    int data;
    struct _node *next;
} node;

typedef node circularlyLinkedList;