算法思想:先序遍历二叉排序树。如果根节点等于x,则将其左子树插入到T1中,右子树插入到T2中;如果根节点大于x,则继续分解他的左子树,并将根节点和他的右子树插入T2中;如果根节点小于x,则继续分解他的右子树,并将根节点和他的左子树插入T1中;重复上述步骤,直到不存在待分解的子树停止.
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
typedef char ElemType;
typedef struct BSTNode {
ElemType data;
struct BSTNode* lchild;
struct BSTNode* rchild;
}BSTNode, * BSTree;
//中序遍历
void inOrder(BSTree T) {
if (T != NULL) {
inOrder(T->lchild);
printf("%c", T->data);
inOrder(T->rchild);
}
}
//插入操作
void insertBSTree(BSTree& T, ElemType num) {
if (T == NULL) {
T = (BSTNode*)malloc(sizeof(BSTNode));
T->data = num;
T->lchild = NULL;
T->rchild = NULL;
}
else if (T->data < num) {
insertBSTree(T->rchild, num);
}
else if (T->data > num) {
insertBSTree(T->lchild, num);
}
}
//创建二叉排序树
BSTree creatBSTree() {
ElemType num;
BSTNode* T = NULL;
while (scanf("%c", &num) && num != '\n') {
insertBSTree(T, num);
}
return T;
}
void insert(BSTNode* pnode, BSTree &T) {
if (T == NULL) {
T = pnode;
}
else if (T->data > pnode->data) {
insert(pnode, T->lchild);
}
else if (T->data < pnode->data) {
insert(pnode, T->rchild);
}
}
/*算法思想:先序遍历二叉排序树。如果根节点等于x,则将其左子树插入到T1中,右子树插入到T2中;如果根节点大于x,则继续分解他的左子树,
并将根节点和他的右子树插入T2中;如果根节点小于x,则继续分解他的右子树,并将根节点和他的左子树插入T1中;重复上述步骤,直到不存在待分解的子树停止*/
void spilittwoTree(BSTree& T, BSTree& T1, BSTree& T2, ElemType x) {
if (T != NULL) {
if (T->data == x) {
insert(T->lchild, T1);
insert(T->rchild, T2);
free(T);
T = NULL;
}
else if (T->data > x) {
spilittwoTree(T->lchild, T1, T2, x);
T->lchild = NULL;
insert(T, T2);//T中右子树的结点都大于K,插入T2中
}
else if (T->data < x) {
spilittwoTree(T->rchild, T1, T2, x);
T->rchild = NULL;
insert(T, T1);//T中左子树结点都大于K,插入T1中
}
}
}
int main() {
BSTree T = creatBSTree();
inOrder(T);
printf("\n");
ElemType x;
scanf("%c", &x);//输入要比较的元素
BSTree T1 = NULL;
BSTree T2 = NULL;
spilittwoTree(T, T1, T2, x);
inOrder(T1);
printf("\n");
inOrder(T2);
printf("\n");
return 0;
}