NOJ数据结构026——二叉排序树的合并

Dear 丶 2022-10-05 06:56 145阅读 0赞

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl81MzA2ODI2OQ_size_16_color_FFFFFF_t_70]

代码如下：

#include<stdio.h>
    #include<stdlib.h>
    
    typedef struct BiTNode {
        
    	int data;
    	struct BiTNode* left;
    	struct BiTNode* right;
    }BiTNode, * BiTree;
    
    BiTree CreateBiTree();   //创建二叉树
    void InsertBi(BiTree* T, int insert);//插入节点
    void CombineBi(BiTree T1, BiTree T2);//合并二叉树T1，T2
    void MidPrint(BiTree T); //中序输出
    
    int main()
    {
        
    	BiTree T1, T2;
    	T1 = CreateBiTree();
    	T2 = CreateBiTree();
    	CombineBi(T1, T2);
    	MidPrint(T1);
    	return 0;
    }
    
    BiTree CreateBiTree()
    {
           //创建二叉树
    	int data;
    	scanf("%d", &data);
    	if (data == -1) {
        
    		return NULL;
    	}
    	BiTree tmp;
    	tmp = (BiTree)malloc(sizeof(BiTNode));
    	if (!tmp) {
        
    		return NULL;
    	}
    	tmp->data = data;
    	tmp->left = CreateBiTree();
    	tmp->right = CreateBiTree();
    	return tmp;
    }
    
    void InsertBi(BiTree* T, int insert)
    {
           //插入结点
    	if (!(*T)) {
        
    		BiTree tmp;
    		tmp = (BiTree)malloc(sizeof(BiTNode));
    		tmp->data = insert;
    		tmp->left = NULL;
    		tmp->right = NULL;
    		*T = tmp;
    		return;
    	}
    	if (insert < (*T)->data) {
        
    		InsertBi(&(*T)->left, insert);
    	}
    	if (insert > (*T)->data) {
        
    		InsertBi(&(*T)->right, insert);
    	}
    }
    
    void CombineBi(BiTree T1, BiTree T2)
    {
           //合并二叉树T1，T2
    	if (!T2) {
        
    		return;
    	}
    	CombineBi(T1, T2->left);
    	InsertBi(&T1, T2->data);
    	CombineBi(T1, T2->right);
    }
    
    void MidPrint(BiTree T)
    {
           //中序输出
    	if (!T) {
        
    		return;
    	}
    	MidPrint(T->left);
    	printf("%d ", T->data);
    	MidPrint(T->right);
    }

[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl81MzA2ODI2OQ_size_16_color_FFFFFF_t_70]: /images/20221005/26af33ab2736495196ebffc15ed7f3f3.png