C to c++ online converter

Convert c++ code to c online

#include<stdio.h>

C to c++ online converter

// implementation of queue
#include <iostream>
#include <conio.h>
#include <stdlib.h>
 using namespace std;
 ///////////////////////////////////////////////////////////////
struct Queue
{
    int  *a;
	int  front;
	int  rear;
	int  size;
    unsigned c;    // capacity
};
 ///////////////////////////////////////////////////////////////
struct Queue* create(unsigned c)
{
    struct Queue* q ;
    q = (struct Queue*) malloc(sizeof(struct Queue));
    
	q->c     = c;
    q->front = 0;
    q->rear  = c - 1;  
   	q->size  = 0; 
    q->a = (int*) malloc(q->c * 4);
    
	return q;
}

C to C++ online Converter

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

typedef struct _tree
{    char v[18];
    int len, index, plus_l, plus_r;
    struct _tree *l, *r;
} Tree;

void Ins(Tree **t, char *val, int val_len, int indeks)
{    if(!(*t))
    {    *t = (Tree*)malloc(sizeof(Tree));

        strcpy((*t)->v, val);

        (*t)->len = val_len;
        (*t)->index = indeks;

        (*t)->plus_l = (*t)->plus_r = 0;
        (*t)->l = (*t)->r = NULL;
    }
    else if(((*t)->len > val_len) || (((*t)->len == val_len) && (strcmp((*t)->v, val) > 0)))
    {    if((*t)->r) Ins(&(*t)->r, val, val_len, 1);
        else
        {    Ins(&(*t)->r, val, val_len, (*t)->index + 1);
            (*t)->plus_r = 0;
        }
    }
    else
    {    (*t)->index += 1;
        (*t)->plus_r += 1;

        if((*t)->l) Ins(&(*t)->l, val, val_len, 1);
        else
        {    Ins(&(*t)->l, val, val_len, (*t)->index - 1);
            (*t)->plus_l = 0;
        }
    }
}

int Find(Tree **t, char *val, int val_len)
{    if(*t)
    {    if(strcmp((*t)->v, val) == 0)
        {    printf("%d\n", (*t)->index);
            return 1;
        }

        else if(((*t)->len > val_len) || (((*t)->len == val_len) && (strcmp((*t)->v, val) > 0)))
        {    if((*t)->plus_r)
            {    if((*t)->r)
                {    int t_plus_r = (*t)->plus_r;

                    (*t)->r->index += t_plus_r;
                    (*t)->r->plus_l += t_plus_r;
                    (*t)->r->plus_r += t_plus_r;
                }

                (*t)->plus_r = 0;
            }

            return Find(&(*t)->r, val, val_len);
        }

        else
        {    if((*t)->plus_l)
            {    if((*t)->l)
                {    int t_plus_l = (*t)->plus_l;

                    (*t)->l->index += t_plus_l;
                    (*t)->l->plus_l += t_plus_l;
                    (*t)->l->plus_r += t_plus_l;
                }

                (*t)->plus_l = 0;
            }

            return Find(&(*t)->l, val, val_len);
        }
    }
    else return 0;
}

int main()
{    int T, cmd, len;
    scanf("%d", &T);

    Tree *t = NULL;
    char val[18];

    while(T--)
    {    scanf("%d %s", &cmd, val);
        len = strlen(val);

        if(cmd == 1) Ins(&t, val, len, 1);
        else if(!Find(&t, val, len)) printf("Data tidak ada\n");
    }

    return 0;
}

Similar codes

99 votes308 views6 answers
How to convert int to string c++
C++
0 vote175 views1 answer
C++ nerds
C++
23 votes146 views6 answers
String to char
C++
0 vote152 views2 answers
C++ program to find prime number using function
C++
3 votes155 views2 answers
Find maximum sum in array of contiguous subarrays
C++
0 vote134 views3 answers
JAJA
C++
5 votes309 views2 answers
How to sort a string alphabetically in c++
C++
0 vote138 views2 answers
How to compile with libstdc++ fedora
C++
1 vote140 views1 answer
Sort array using inbuilt sort function in decreasing order
C++
1 vote325 views1 answer
How to iterater map of sets in c++
C++