#include <stdio.h>
#include<stdlib.h>
struct BinaryTree{
int data;
struct BinaryTree *left;
struct BinaryTree *right;
};
struct BinaryTree *root=NULL;
struct BinaryTree *node(int data)
{
struct BinaryTree *node;
node
=(struct BinaryTree
*)malloc(sizeof(struct BinaryTree
)); node->data=data;
node->left=node->right=NULL;
return node;
}
struct BinaryTree *insert(int *root,int data1){
if(root==NULL){
root=node(data1);
return root;
}
}
int main() {
root=insert(root,10);
return 0;
}
I2luY2x1ZGUgPHN0ZGlvLmg+CiNpbmNsdWRlPHN0ZGxpYi5oPgogCnN0cnVjdCBCaW5hcnlUcmVlewoJaW50IGRhdGE7CglzdHJ1Y3QgQmluYXJ5VHJlZSAqbGVmdDsKCXN0cnVjdCBCaW5hcnlUcmVlICpyaWdodDsKfTsKc3RydWN0IEJpbmFyeVRyZWUgKnJvb3Q9TlVMTDsKIAogc3RydWN0IEJpbmFyeVRyZWUgKm5vZGUoaW50IGRhdGEpCiB7CiAJc3RydWN0IEJpbmFyeVRyZWUgKm5vZGU7CiAJbm9kZT0oc3RydWN0IEJpbmFyeVRyZWUqKW1hbGxvYyhzaXplb2Yoc3RydWN0IEJpbmFyeVRyZWUpKTsKIAlub2RlLT5kYXRhPWRhdGE7CiAJbm9kZS0+bGVmdD1ub2RlLT5yaWdodD1OVUxMOwogCXJldHVybiBub2RlOwogfQpzdHJ1Y3QgQmluYXJ5VHJlZSAqaW5zZXJ0KGludCAqcm9vdCxpbnQgZGF0YTEpewoJaWYocm9vdD09TlVMTCl7CgkJcm9vdD1ub2RlKGRhdGExKTsKCQlyZXR1cm4gcm9vdDsKCX0KfQppbnQgbWFpbigpIHsKCXJvb3Q9aW5zZXJ0KHJvb3QsMTApOwoJcHJpbnRmKCIlZCIsKnJvb3QpOwoJcmV0dXJuIDA7Cn0KIA==