以下是一个简单的C语言数据结构二叉树的基本操作代码，包括创建、插入、删除和查找节点以及遍历

#define _CRT_SECURE_NO_WARNINGS 1
#include<stdlib.h>
#include<stdio.h>
#include<assert.h>
//定义一个二叉树结构体
typedef struct TreeNode
{
	int data;
	struct TreeNode* left;
	struct TreeNode* right;
}TreeNode;
//创建新节点
TreeNode* createNode(int data)
{
	TreeNode* newnode = (TreeNode*)malloc(sizeof(TreeNode));
	assert(newnode);
	newnode->data = data;
	newnode->left = NULL;
	newnode->right = NULL;
	return newnode;
}
//插入节点到二叉树
TreeNode* insertNode(TreeNode* root, int data)
{
	if (root == NULL)
	{
		return createNode(data);
	}
	if (data < root->data)
	{
		root->left = insertNode(root->left,data);
	}
	else if (data> root->data)
	{
		root->right = insertNode(root->right, data);
	}
	return root;
}
//遍历，这里我使用的是中序遍历  左根右
void printNode(TreeNode* root) {
	if (root != NULL) 
	{
		printNode(root->left);
		printf("%d ", root->data);
		printNode(root->right);
	}
}
//查找元素
TreeNode* searchNode(TreeNode* root,int data)
{
	if (root == NULL || root->data == data)
	{
		return root;
	}
	if (data<root->data)
	{
		return searchNode(root->left, data);
	}
	else
	{
		return searchNode(root->right, data);
	}
}
//删除节点
TreeNode* delectNode(TreeNode* root, int data)
{
	if (root == NULL)
	{
		printf("根节点为空，无删除内容\n");
		return;
	}
	if (data < root->data)
	{
		return delectNode(root->left, data);
	}
	else if (data > root->data)
	{
		return delectNode(root->right, data);
	}
	else 
	{
		if (root->left == NULL)
		{
			TreeNode* temp = root->right;
			free(root);
			return temp;
		}
		else if (root->right == NULL)
		{
			TreeNode* temp = root->left;
			free(root);
			return temp;
		}
		//如果左右都不为空
		TreeNode* temp = root->right;
		while (temp->left != NULL)
		{
			temp = temp->left;//如果说删除root节点的右子树的节点也有左子树，那么把这个左子树成为root
		}
		root->data = temp->data;//看似要消除root节点，其实是把右边的子树节点代替它，真正销毁的是右节点
		root->right = delectNode(root->right, temp->data);
	}
	return root;
}
void freeTree(TreeNode* root)
{
	if (root == NULL)
	{
		return;
	}

	free(root->left);
	free(root->right);
	free(root);
}
int main()
{
	TreeNode* root = NULL;

	root = insertNode(root, 50);
	root = insertNode(root, 30);
	root = insertNode(root, 20);
	root = insertNode(root, 40);
	root = insertNode(root, 70);
	root = insertNode(root, 60);
	root = insertNode(root, 80);

	printf("中序遍历如下\n");
	printNode(root);
	printf("\n");

	printf("请输入你要查找的元素\n");
	int data;
	scanf("%d", &data);
	TreeNode* ret = searchNode(root, data);
	if (ret != NULL)
	{
		printf("%d节点在二叉树中找到\n", ret->data);
	}
	else {
		printf("节点找不到\n");
	}

	printf("请输入你要删除的节点\n");
	int delect_data;
	scanf("%d", &delect_data);
	TreeNode* ret2 = delectNode(root, delect_data);
	printf("删除成功,如下显示\n");
	printNode(root);

	freeTree(root);
	printf("空间释放成功\n");

	return 0;
}