二叉排序树又称二叉搜索树,是具有下列性质的二叉树:
(1)若左子树不空,则左子树上所有结点的值均小于它的根结点的值;
(2)若右子树不空,则右子树上所有结点的值均大于它的根结点的值;
(3)左、右子树也分别为二叉排序树;
(4)没有键值相等的结点。
如果一定要储存键值相等的结点可以储存相同节点个数。
树的每个节点如图:
一棵二叉排序树就例如:
代码实现如下:
#include<iostream>
using namespace std;
typedef int Element;
typedef struct Node {
Element data;
Node* left;
Node* right;
int number; /*储存该数据个数*/
}*BTree;
bool SearchTNode(BTree T, int key, BTree parent, BTree* p) { /*寻找树中是否有相同数据*/
if (!T) {
*p = parent; /*返回要插入数据父节点*/
return false;
}
else if (key == T->data) {
T->number += 1; /*相同数据,该节点个数加一*/
return true;
}
else if (key > T->data) {
SearchTNode(T->right, key, T/*父节点不断变换*/, p);
}
else if (key < T->data) {
SearchTNode(T->left, key, T, p);
}
}
void InsertTNode(BTree *T,int data) {
BTree p, s;
s = (BTree)malloc(sizeof(Node));
s->data = data;
s->left = s->right = NULL;
s->number = 1;
if (SearchTNode(*T, s->data, NULL, &p) == false) {
if (p == NULL) { /*空树情况*/
*T = s;
}
else if (s->data > p->data) {
p->right = s;
}
else if (s->data < p->data) {
p->left = s;
}
}
}
/*中序遍历*/
void ZTravarse(BTree T) {
if (!T)
return;
ZTravarse(T->left);
for (int i = 0; i < T->number; i++) {
cout << T->data << " ";
}
ZTravarse(T->right);
}
int main() {
int a[10] = {3,15,6,4,5,3,12,10,17,18 };
BTree T = NULL;
for (int i = 0; i < 10; i++) {
InsertTNode(&T, a[i]);
}
ZTravarse(T);
return 0;
}