题目: 二叉排序树之父结点
问题描述
给你N个关键字值各不相同的节点,要求你按顺序插入一个初始为空树的二叉排序树中,每次插入后成功后,求相应的父亲节点的关键字值,如果没有父亲节点,则输出-1。
输入格式
测试数据有两行。第一行是一个数字N(N<=100),表示待插入的节点数。第二行是N个互不相同的正整数,表示要顺序插入节点的关键字值,这些值不超过10^8。
输出格式
输出共N行,每次插入节点后,输出该节点对应的父亲节点的关键字值。
样例输入
5
2 5 1 3 4
样例输出
-1
2
2
5
3
样例说明
无。
方法一:
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
typedef struct BiTNode
{
int key;
struct BiTNode* lchild, * rchild;
}BiTNode, * BiTree;
typedef struct Family
{
int parent;
int self;
int lchild;
int rchild;
}Family;
int InsertBST(BiTree* T, int key);
BiTree Search(BiTree T, int e);
int main()
{
int n;
int tree[100];
Family family[100];
int i, j, k;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &tree[i]);
BiTree T = NULL;
for (i = 0; i < n; i++)//构造二叉排序树
InsertBST(&T, tree[i]);
for (i = 0; i < n; i++)
{
BiTree q = Search(T, tree[i]);
family[i].self = q->key;
if (q->lchild != NULL)
family[i].lchild = q->lchild->key;
else if (q->lchild == NULL)
family[i].lchild = 0;
if (q->rchild != NULL)
family[i].rchild = q->rchild->key;
else if (q->rchild == NULL)
family[i].rchild = 0;
}
for (i = 0; i < n; i++)
family[i].parent = -1;
for (i = 0; i < n; i++)
{
for (j = 0; j < n; j++)
{
if (family[i].self == family[j].lchild || family[i].self == family[j].rchild)
{
family[i].parent = family[j].self;
break;
}
}
}
for (i = 0; i < n; i++)
printf("%d\n", family[i].parent);
return 0;
}
int InsertBST(BiTree* T, int key)
{
if (*T == NULL)
{
(*T) = (BiTree)malloc(sizeof(BiTNode));
(*T)->key = key;
(*T)->lchild = (*T)->rchild = NULL;
return 1;
}
else if (key == (*T)->key)
return 0;
else if (key < (*T)->key)
return InsertBST(&(*T)->lchild, key);
else
return InsertBST(&(*T)->rchild, key);
}
BiTree Search(BiTree T, int e)
{
if (T != NULL)
{
if (e == T->key)
return T;
else if (T->lchild != NULL && e < T->key)
return Search(T->lchild, e);
else if (T->rchild != NULL && e > T->key)
return Search(T->rchild, e);
}
}
方法二:
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
typedef struct BiTNode
{
int key;
struct BiTNode* lchild, * rchild;
}BiTNode, * BiTree;
int InsertBST(BiTree* T, int key);
BiTree Search(BiTree T, int e);
int main()
{
int n;
BiTree T = NULL;
int i = 0, j, k;
scanf("%d", &n);
for (k = 0; k < n; k++)
{
int key;
scanf("%d", &key);
printf("%d\n", InsertBST(&T, key));
}
return 0;
}
int InsertBST(BiTree* T, int key)
{
if (*T == NULL)
{
(*T) = (BiTree)malloc(sizeof(BiTNode));
(*T)->key = key;
(*T)->lchild = (*T)->rchild = NULL;
return -1;
}
else if (key < (*T)->key)
{
if (InsertBST(&(*T)->lchild, key) == -1)
return ((*T)->key);
}
else
{
if (InsertBST(&(*T)->rchild, key) == -1)
return ((*T)->key);
}
}