写了一个二叉树的完整实现

 主函数文件

1. #pragma once 
2. #include "BinaryTree.h" 
3.  
4. int main(){ 
5.     BinaryTree<int> a; 
6.     a.build(  a.getDRoot()); 
7.     cout<<"a.levelOrder(a.getRoot() );"<<endl; 
8.     a.levelOrder(a.getRoot() );   //right! 
9.     cout<<"a.postOrder(a.getRoot());"<<endl; 
10.     a.postOrder(a.getRoot()); 
11.     cout<<endl; 
12.     cout<<"a.inOrder(a.getRoot());"<<endl; 
13.     a.inOrder(a.getRoot()); 
14.     cout<<"a.preOrder(a.getRoot());"<<endl; 
15.     a.preOrder(a.getRoot()); 
16.     cout<<"a.deleteBinaryTree(a.getRoot()->getLeftChild());"<<endl; 
17.     a.deleteBinaryTree(a.getRoot()->getLeftChild()); 
18.     a.levelOrder(a.getRoot() ); 
19.     exit(0); 
20. } 

BinaryTreeNote.h

 

1. BinaryTreeNote<T>* BinaryTreeNote<T>::getLeftChild(){ 
2.     return this->left; 
3. } 
4. template<class T> 
5. BinaryTreeNote<T>* BinaryTreeNote<T>::getRightChile(){ 
6.     return this->right; 
7. } 
8. template<class T> 
9. T BinaryTreeNote<T>::getValue()const{ 
10.     return this->data; 
11. } 
12. template<class T> 
13. bool BinaryTreeNote<T>::isLeaf()const { 
14.     return ! (this->left||this->right); 
15. } 
16. template<class T>  
17. void BinaryTreeNote<T>::setLeftChild(BinaryTreeNote* l ){ 
18.     this->left=l; 
19. } 
20. template<class T> 
21. void BinaryTreeNote<T>::setRightChild(BinaryTreeNote* r ){ 
22.     this->right=r; 
23. } 
24. template<class T> 
25. BinaryTreeNote<T>::~BinaryTreeNote(){ 
26.      
27. } 

BinaryTree.h

 

1. #pragma once 
2. #include<iostream> 
3. #include<queue> 
4. #include<stack> 
5. #include"BinaryTreeNote.h" 
6. #include<string> 
7. using namespace std; 
8.  
9. template<class T> 
10. class BinaryTree{ 
11.     BinaryTreeNote<T> *rt; 
12.     int num; 
13. public: 
14.     BinaryTree(); 
15.     ~BinaryTree(); 
16.     bool isEmpty( ) const; 
17.     BinaryTreeNote<T>* getRoot()const;  //return root note 
18.     BinaryTreeNote<T>* getParent(BinaryTreeNote<T>* current )const;   //return parent note 
19.     BinaryTreeNote<T>* getLeftSibing(BinaryTreeNote<T>* current ) const;  //return left brother 
20.     BinaryTreeNote<T>* getRightSibing(BinaryTreeNote<T>* current ) const;  //return right brother 
21.     void breadFristOrder(BinaryTreeNote<T>* );  //广度优先遍历 
22.     void preOrder(BinaryTreeNote<T>* );  //  前序 
23.     void inOrder(BinaryTreeNote<T>* );  //中序 
24.     void postOrder(BinaryTreeNote<T>* );   //后序 
25.     void levelOrder(BinaryTreeNote<T>* );   // 
26.     void deleteBinaryTree(BinaryTreeNote<T>* root);  //delete the tree which is the charge of root 
27.     void build(BinaryTreeNote<T>** ); 
28.     BinaryTreeNote<T>** getDRoot(){ 
29.         return &rt; 
30.     }  
31. }; 
32. template<class T> 
33. BinaryTree<T>::BinaryTree( ):rt(new BinaryTreeNote<T>),num(0){ } 
34. template<class T> 
35. bool BinaryTree<T>::isEmpty( )const{ 
36.     return !rt; 
37. } 
38. template<class T> 
39. BinaryTreeNote<T>* BinaryTree<T>::getRoot() const{ 
40.     return rt; 
41. } 
42. template<class T> 
43. BinaryTreeNote<T>* BinaryTree<T>::getParent(BinaryTreeNote<T>* current ) const { 
44.     queue<BinaryTreeNote<T>*> n; 
45.     BinaryTreeNote<T>* cur; 
46.     n.push(this->getRoot()); 
47.     while(!n.empty() ){ 
48.         cur=n.front(); 
49.         n.pop(); 
50.         if(cur->getLeftChild()==current ||cur->getRightChile()==current  ) 
51.             return cur; 
52.         if( cur->getLeftChild()!=0) 
53.             n.push(cur->getLeftChild); 
54.         else if(cur->getRightChile()) 
55.             n.push(cur->getRightChile()); 
56.     } 
57. } 
58. template<class T> 
59. BinaryTreeNote<T>* BinaryTree<T>::getLeftSibing(BinaryTreeNote<T>* current ) const{ 
60.     if( this->getParent()==NULL) 
61.         return NULL; 
62.     return this->getParent(current)->getLeftChild(); 
63. } 
64. template<class T> 
65. BinaryTreeNote<T>* BinaryTree<T>::getRightSibing(BinaryTreeNote<T>* current ) const{ 
66.     if( this->getParent()==NULL) 
67.         return NULL; 
68.     return this->getParent(current)->getRightChile(); 
69. } 
70. template<class T> 
71. void  BinaryTree<T>::breadFristOrder( BinaryTreeNote<T>* root ){ 
72.     queue<BinaryTreeNote<T>*> local; 
73.     local.push(root ); 
74.     BinaryTreeNote<T>* index=local.front(); 
75.     while( !local.empty() ){ 
76.         if( index ){ 
77.             local.push(index->getLeftChild()); 
78.             local.push(index->getRightChile()); 
79.             cout<<index->getValue()<<" "; 
80.         } 
81.         local.pop(); 
82.     } 
83.     cout<<endl; 
84. } 
85. template<class T> 
86. void  BinaryTree<T>::preOrder(BinaryTreeNote<T>* root) { 
87.     BinaryTreeNote<T>* cur=root; 
88.     stack<BinaryTreeNote<T>*> n; 
89.     while( cur || !n.empty() ){ 
90.         if( cur ){ 
91.             cout<<cur->data<<" "; 
92.             if(cur->getRightChile() ) 
93.                 n.push(cur->getRightChile()); 
94.             cur=cur->getLeftChild(); 
95.         } 
96.         else{ 
97.             cur=n.top(); 
98.             n.pop(); 
99.         } 
100.     } 
101.     cout<<endl; 
102. } 
103. template<class T> 
104. void  BinaryTree<T>::inOrder(BinaryTreeNote<T>* root){ 
105.     //关键部分就是把一个过程抽象成一步一步执行相同的过程！ 
106.     BinaryTreeNote<T>* cur=root; 
107.     stack<BinaryTreeNote<T>* > n; 
108.     while( !n.empty() || cur!=0  ){ 
109.         if(cur ){ 
110.             n.push(cur); 
111.             cur=cur->getLeftChild(); 
112.         } 
113.         else{ 
114.             cur=n.top(); 
115.             cout<<cur->getValue()<<" "; 
116.             cur=cur->getRightChile(); 
117.             n.pop(); 
118.         } 
119.     } 
120.     cout<<endl; 
121. } 
122. template<class T> 
123. void  BinaryTree<T>::postOrder(BinaryTreeNote<T>* root){ 
124.     stack<BinaryTreeNote<T>* > n; 
125.     BinaryTreeNote<T>* cur=root; 
126.     BinaryTreeNote<T>* pre=root; 
127.     while( cur ){ 
128.         while( cur->getLeftChild() ){ 
129.             n.push(cur); 
130.             cur=cur->getLeftChild(); 
131.         } 
132.         while( cur &&( cur->getRightChile()==0 || cur->getRightChile()==pre ) ){ 
133.             cout<<cur->getValue()<<" "; 
134.             pre=cur; 
135.             if(n.empty()) 
136.                 return; 
137.             cur=n.top(); 
138.             n.pop(); 
139.         } 
140.         n.push(cur); 
141.         cur=cur->getRightChile(); 
142.     } 
143.     cout<<endl; 
144. } 
145. template<class T> 
146. void  BinaryTree<T>::levelOrder(BinaryTreeNote<T>* root){ 
147.     if(!root) 
148.         return ; 
149.     queue<BinaryTreeNote<T>* > n; 
150.     BinaryTreeNote<T>* cur; 
151.     n.push(root); 
152.     while(!n.empty() ){ 
153.         cur=n.front(); 
154.         n.pop(); 
155.         cout<<cur->getValue()<<" "; 
156.         if( cur->getLeftChild()!=0) 
157.             n.push(cur->getLeftChild()); 
158.         if(cur->getRightChile()!=0) 
159.             n.push(cur->getRightChile()); 
160.     } 
161.     cout<<endl; 
162. } 
163. template<class T> 
164. void  BinaryTree<T>::deleteBinaryTree(BinaryTreeNote<T>* root){ 
165.     if(!root) 
166.         return ; 
167.     queue<BinaryTreeNote<T>* > n; 
168.     BinaryTreeNote<T>* cur; 
169.     n.push(rt); 
170.     if(root==rt) 
171.         rt=0; 
172.     while(!n.empty() ){ 
173.         cur=n.front(); 
174.         n.pop(); 
175.         if(cur->getLeftChild()==root ){ 
176.             cur->left=0; 
177.             break; 
178.         } 
179.         else if(cur->getRightChile()==root ){ 
180.             cur->right=0; 
181.             break; 
182.         } 
183.         if( cur->getLeftChild()!=0) 
184.             n.push(cur->getLeftChild()); 
185.         if(cur->getRightChile()!=0) 
186.             n.push(cur->getRightChile()); 
187.     } 
188. } 
189. template<class T> 
190. BinaryTree<T>::~BinaryTree(){ 
191.     this->deleteBinaryTree (this->rt); 
192. } 
193. //下面是一段2重的指针代码....... 
194. template<class T> 
195. void BinaryTree<T>::build(BinaryTreeNote<T>** root){ 
196.     T h; 
197.     static int ll=0; 
198.     if(ll++==0) 
199.         cout<<"root:"; 
200.     if(cin>>h){ 
201.         *root=new BinaryTreeNote<T>; 
202.         num++; 
203.         (*root)->data=h; 
204.         cout<<h<<" left:";       
205.         build(&((*root)->left)); 
206.         cout<<h<<" right:"; 
207.         build(&((*root)->right)); 
208.     } 
209.     else{ 
210.         cin.clear(); 
211.         return ; 
212.     } 
213. } 

 

转载于:https://blog.51cto.com/treap/1056679