简单二叉排序树的实现

 1 #include <iostream>
 2 using namespace std;
 3 
 4 struct BiTNode
 5 {
 6     int data;
 7     BiTNode *lchild, *rchild;
 8     BiTNode(int x) :data(x), lchild(NULL), rchild(NULL){}
 9 };
10 
11 void Insert(BiTNode *&root, int key)
12 {
13     if (root == NULL)
14         root = new BiTNode(key);
15     else if (key < root->data)
16         Insert(root->lchild, key);
17     else if (key > root->data)
18         Insert(root->rchild, key);
19 }
20 
21 void Create(BiTNode *&root)
22 {
23     int key;
24     while (cin >> key)
25     {
26         if (key == -1)
27             break;
28         Insert(root, key);
29     }
30 }
31 
32 //中序遍历
33 void InorderTraversal(BiTNode *root)
34 {
35     if (root)
36     {
37         InorderTraversal(root->lchild);
38         cout << root->data << ‘ ‘;
39         InorderTraversal(root->rchild);
40     }
41 }
42 
43 //获得最小值结点
44 BiTNode *GetMinValue(BiTNode *root)
45 {
46     if (root == NULL)
47         return NULL;
48     if (root->lchild == NULL)
49         return root;
50     return GetMinValue(root->lchild);
51 }
52 
53 //获得最大值结点
54 BiTNode *GetMaxValue(BiTNode *root)
55 {
56     if (root == NULL)
57         return NULL;
58     if (root->rchild == NULL)
59         return root;
60     return GetMaxValue(root->rchild);
61 }
62 
63 bool IsContains(BiTNode *root, int key)
64 {
65     if (root == NULL)
66         return false;
67     else if (key < root->data)
68         IsContains(root->lchild, key);
69     else if (key > root->data)
70         IsContains(root->rchild, key);
71     else
72         return true;
73 }
74 
75 int main()
76 {
77     BiTNode *root = NULL;
78     int toFindVal;
79     cout << "请输入值建立二叉树（-1代表结束）";
80     Create(root);
81     cout << "中序遍历：";
82     InorderTraversal(root);
83     cout << "\n最小值：" << GetMinValue(root)->data;
84     cout << "\n最大值：" << GetMaxValue(root)->data;
85     cout << "\n请输入要查找的结点值";
86     cin >> toFindVal;
87     if (IsContains(root, toFindVal))
88         cout << "结点已查找到" << endl;
89     else
90         cout << "结点未查找到" << endl;
91 }