<commit_before>/*-----<NAME> , AM: 2025200800094---------*/

#include <stdio.h>

typedef struct node{
	int key;
	struct node *left;
	struct node *right;
}node;
	

int main(int argc, char **argv){
	
	
	
	
	return 1;
}<commit_msg>Latest<commit_after>/*-----<NAME> , AM: 2025200800094---------*/

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


typedef struct TreeNode{
	int key;
	struct TreeNode *left;
	struct TreeNode *right;
}*TreeNode;
	
void insert(TreeNode *,int);

int main(int argc, char *argv[]){
	int key;
	TreeNode *root;
	while(1){
	if(strcmp(argv[0],"insert")==0){
		key=atoi(argv[1]);
		insert(root,key);
	}
		
}
	
	
	
	
	return 1;
}

void insert(TreeNode *root, int x) {
TreeNode *v = root; // v τρέχων κόμβος
TreeNode *pv = NULL; // pv γονέας v
while (v != NULL) { // επαναληπτική εκδοχή
pv = v;
if (x < v->key) v=v->left;
else if (x > v->key) v=v->right;
else { // υπάρχει ήδη
printf(”error: duplicate”);
exit(1);}
}
TreeNode *tmp = malloc(sizeof(TreeNode));
tmp->key=x; tmp->left=tmp->right=NULL;
if (root != NULL) {
if (x < pv->key) pv->left=tmp;
else pv->right=tmp;
} else root=tmp;
//return root; // επιστροφή ρίζας δέντρου
}
{'fraction_non_alphanumeric': 0.20390824129141885, 'fraction_numerical': 0.028037383177570093, 'mean_word_length': 3.565891472868217, 'pattern_counts': {'":': 0, '<': 12, '<?xml version=': 0, '>': 21, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '2588561', 'n_tokens_mistral': 573, 'n_tokens_neox': 501, 'n_words': 125}