-------------------------------------
典型例题15:数据结构问题---二叉搜索树问题
-------------------------------------
1 #include <iostream>
2 #include <cstdlib>
3
4 using namespace std;
5
6 typedef int ElemType;
7
8 typedef struct BTreeNode {
9 ElemType data;
10 BTreeNode* left;
11 BTreeNode* right;
12 };
13
14 void InitBTree(BTreeNode*& BT)
15 {
16 BT = NULL;
17 }
18
19 bool find(BTreeNode* BST,ElemType& item)
20 {
21 if(BST == NULL) return false;
22 else{
23 if (item == BST->data)
24 {
25 item = BST->data;
26 return true;
27 }else if(item<BST->data)
28 return find(BST->left,item);
29 else
30 return find(BST->right,item);
31 }
32 }
33
34
35 bool find1(BTreeNode* BST,ElemType& item)
36 {
37 if(BST == NULL) return false;
38 else{
39 while (BST!=NULL)
40 {
41 if (item == BST->data)
42 {
43 item = BST->data;
44 return true;
45 }else if(item<BST->data) BST = BST->left;
46 else BST = BST->right;
47 }
数据结构问题---二叉搜索树问题
最新推荐文章于 2024-07-06 22:34:06 发布