#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <limits.h>
static int idd = 1;
typedef struct node{
int low, high, inter, id;
struct node *left;
struct node *right;
}node;
int min(int a, int b)
{
if (a<b)
return a;
return b;
}
int max(int a, int b)
{
if (a<b)
return b;
return a;
}
int isBetween(int n, int f, int t)
{
return f <= n && n <= t;
}
int intersect(int f1, int t1, int f2, int t2) {
if ( isBetween(f1, f2, t2) ) {
return 1;
} else if ( isBetween(f2, f1, t1) ) {
return 1;
} else {
return 0;
}
}
struct node *minValue(node *root)
{
while(root->left != NULL)
root = root->left;
return root;
}
struct node *createNode( int low, int high)
{
node *result = (node*) malloc(sizeof(node));
if(result)
{
result->left = NULL;
result->right = NULL;
result->inter = 0;
result->low = low;
result->high = high;
result->id = idd++;
}
return result;
}
struct node *delete(struct node* root, int key)
{
if(root == NULL) return root;
if(key < root->low)
root->left = delete(root->left, key);
else if(key > root->low)
root->right = delete(root->right, key);
else{
if(root->left == NULL)
return root->right;
else if(root->right == NULL)
return root->left;
struct node *min = minValue(root->right);
root->low = min->low;
root->high = min->high;
root->id = min->id;
root->right = delete(root->right, root->low);
}
return root;
}
int insertIntersect(struct node *root, int low, int high, int *left, int *right)
{
if( root == NULL)
return 0;
insertIntersect(root->left, low, high, left, right);
insertIntersect(root->right, low, high, left, right);
if(!intersect(root->low, root->high, low, high))
return 0;
else
{
*left = min(*left,min(root->low, low));
*right = max(*right, max(root->high, high));
root->inter = 1;
delete(root, root->low);
}
return 0;
}
struct node *insert(struct node *root, int low, int high)
{
if(root == NULL)
return createNode(low, high);
if( low < root->low && high < root->high)
root->left = insert(root->left, low, high);
else if (low > root->low && high > root->high)
root->right = insert(root->right, low, high);
else
{
int left = INT_MAX, right = INT_MIN;
insertIntersect(root, low, high, &left, &right);
root->low = left;
root->high = right;
}
return root;
}
void printTree(struct node *root)
{
if(!root)
return;
printTree(root->left);
printf("[ %d, %d, inter: %d, id: %d ] \n", root->low, root->high, root->inter, root->id);
printTree(root->right);
}
int main ()
{
struct node *root = NULL;
/*
(10,13)
(4,7) (17,22)
(1,3) (8,9)
*/
root = insert(root, 10, 13);
root = insert(root, 4, 7);
root = insert(root, 1, 3);
root = insert(root, 8, 9);
root = insert(root, 17, 22);
// not disjunct
root = insert(root, 6, 25);
printTree(root);
}
Write, Run & Share C Language code online using OneCompiler's C online compiler for free. It's one of the robust, feature-rich online compilers for C language, running the latest C version which is C18. Getting started with the OneCompiler's C editor is really simple and pretty fast. The editor shows sample boilerplate code when you choose language as 'C' and start coding!
OneCompiler's C online editor supports stdin and users can give inputs to programs using the STDIN textbox under the I/O tab. Following is a sample C program which takes name as input and print your name with hello.
#include <stdio.h>
int main()
{
char name[50];
printf("Enter name:");
scanf("%s", name);
printf("Hello %s \n" , name );
return 0;
}
C language is one of the most popular general-purpose programming language developed by Dennis Ritchie at Bell laboratories for UNIX operating system. The initial release of C Language was in the year 1972. Most of the desktop operating systems are written in C Language.
When ever you want to perform a set of operations based on a condition if-else is used.
if(conditional-expression) {
// code
} else {
// code
}
You can also use if-else for nested Ifs and if-else-if ladder when multiple conditions are to be performed on a single variable.
Switch is an alternative to if-else-if ladder.
switch(conditional-expression) {
case value1:
// code
break; // optional
case value2:
// code
break; // optional
...
default:
// code to be executed when all the above cases are not matched;
}
For loop is used to iterate a set of statements based on a condition.
for(Initialization; Condition; Increment/decrement){
// code
}
While is also used to iterate a set of statements based on a condition. Usually while is preferred when number of iterations are not known in advance.
while(condition) {
// code
}
Do-while is also used to iterate a set of statements based on a condition. It is mostly used when you need to execute the statements atleast once.
do {
// code
} while (condition);
Array is a collection of similar data which is stored in continuous memory addresses. Array values can be fetched using index. Index starts from 0 to size-1.
data-type array-name[size];
data-type array-name[size][size];
Function is a sub-routine which contains set of statements. Usually functions are written when multiple calls are required to same set of statements which increases re-usuability and modularity.
Two types of functions are present in C
Library functions are the in-built functions which are declared in header files like printf(),scanf(),puts(),gets() etc.,
User defined functions are the ones which are written by the programmer based on the requirement.
return_type function_name(parameters);
function_name (parameters)
return_type function_name(parameters) {
//code
}