二叉树 


  1. // BTree.cpp : Defines the entry point for the console application.
  2. //
  4. #include "stdafx.h"
  5. #include <iostream>
  6. #include <stack>
  8. using namespace std;
  10. typedef struct BTree_node {
  11. 	int data ;
  12. 	BTree_node * left;
  13. 	BTree_node * right;
  14. } BTree ;
  18. BTree *create_node ( int data )
  19. {
  20. 	BTree *node = new BTree();
  21. 	node->data = data ;
  22. 	node->left = node->right = NULL ;
  23. 	return node;
  24. }
  27. /*
  28. ·ÇµÝ¹é·½Ê½²åÈë
  29. */
  30. void insert_node ( BTree * root , int data )
  31. {
  32. 	BTree * node = root ;	
  33. 	BTree * last = root ;
  34. 	while (node != NULL ) {
  35. 		last = node ;
  36. 		if ( data < node->data ) 
  37. 			node = node->left;
  38. 		else
  39. 			node = node->right;
  40. 	}
  42. 	if( data < last->data )
  43. 		last->left = create_node ( data );
  44. 	else
  45. 		last->right = create_node ( data );
  46. }
  48. /*
  49. µÝ¹é+ÆÕָͨÕ뷽ʽ²åÈë
  50. */
  51. void insert_node_recursive ( BTree *node  , int data )
  52. {
  53. 	if ( data < node->data ) {
  54. 		if ( node->left == NULL ) {
  55. 			node->left = create_node ( data ) ;
  56. 			return ;
  57. 		}else 
  58. 			insert_node_recursive( node->left, data );
  59. 	}else {
  60. 		if (node->right == NULL ) {
  61. 			node->right = create_node ( data ) ;
  62. 			return ;
  63. 		}else {
  64. 			insert_node_recursive( node->right, data );
  65. 		}
  66. 	}		
  67. }
  69. /*
  70. µÝ¹é+¶þ¼¶Ö¸Õ뷽ʽ²åÈë
  71. */
  72. void insert_node_recursive_ptr2tptr (BTree **node  , int data ) 
  73. {
  74. 	if( *node == NULL ){
  75. 		*node = create_node ( data ) ;
  76. 		return ;
  77. 	}
  79. 	if ( data < (*node)->data ) 
  80. 		insert_node_recursive_ptr2tptr( &((*node)->left), data );
  81. 	else
  82. 		insert_node_recursive_ptr2tptr( &((*node)->right), data );
  83. }
  86. /*
  87. µÝ¹é+Ö¸ÕëÒýÓõķ½Ê½²åÈë
  88. */
  89. void insert_node_recursive_reference (BTree* &node  , int data ) 
  90. {
  91. 	if( node == NULL ){
  92. 		node = create_node ( data ) ;
  93. 		return ;
  94. 	}
  96. 	if ( data < node->data ) 
  97. 		insert_node_recursive_reference( node->left, data );
  98. 	else
  99. 		insert_node_recursive_reference( node->right, data );
  100. }
  106. // Ïȸù±éÀú(µÝ¹é)
  107. void traversal_DLR_recursive ( BTree * node )
  108. {
  109. 	if( node == NULL ) return ;
  110. 	cout<< node->data <<",";
  111. 	traversal_DLR_recursive ( node->left );
  112. 	traversal_DLR_recursive ( node->right );
  113. }
  115. // Ïȸù±éÀú(·ÇµÝ¹é)
  116. void traversal_DLR ( BTree * node )
  117. {
  118. 	stack<BTree *> last;
  119. 	while ( node != NULL ) {
  120. 		cout<<node->data<<",";
  121. 		if ( node->left != NULL ) {
  122. 			if ( node->right != NULL ) {
  123. 				last.push(node->right);
  124. 			}
  125. 			node =  node->left;
  126. 		} else if ( node->right != NULL ) {
  127. 			node = node->right;
  128. 		} else {
  129. 			if ( last.empty() )  return;
  130. 			node = last.top();
  131. 			last.pop();
  132. 		}
  133. 	}
  134. }
  136. // Öиù±éÀú(µÝ¹é)
  137. void traversal_LDR_recursive ( BTree * node )
  138. {
  139. 	if( node == NULL ) return ;
  140. 	traversal_LDR_recursive ( node->left );
  141. 	cout<< node->data <<",";
  142. 	traversal_LDR_recursive ( node->right );
  143. }
  145. // Öиù±éÀú(·ÇµÝ¹é)
  146. void traversal_LDR ( BTree * node )
  147. {
  148. 	stack<BTree *> last;
  149. 	while ( node != NULL ) {
  150. 		if( !last.empty() && node == last.top() ) {
  151. 			cout<<node->data<<",";
  152. 			if ( node->right != NULL ) {
  153. 				last.pop();
  154. 				node = node->right;
  155. 			} else {
  156. 				last.pop();
  157. 				if ( last.empty() )  return;
  158. 				node = last.top();
  159. 			}
  160. 		} else if ( node->left != NULL ) {
  161. 			last.push(node);
  162. 			node =  node->left;
  163. 		} else if ( node->right != NULL ) {
  164. 			cout<<node->data<<",";
  165. 			node = node->right;
  166. 		} else {
  167. 			cout<<node->data<<",";
  168. 			if ( last.empty() )  return;
  169. 			node = last.top();
  170. 		}
  171. 	}
  172. }
  174. // ºó¸ù±éÀú(µÝ¹é)
  175. void traversal_LRD_recursive ( BTree * node )
  176. {
  177. 	if( node == NULL ) return ;
  178. 	traversal_LRD_recursive ( node->left );
  179. 	traversal_LRD_recursive ( node->right );
  180. 	cout<< node->data <<",";
  181. }
  183. // ºó¸ù±éÀú(·ÇµÝ¹é,Õ»¸¨Öú)
  184. void traversal_LRD ( BTree * node )
  185. {
  186. 	stack<BTree *> last;
  187. 	stack<BTree *> last_left;
  188. 	stack<BTree *> last_right;
  190. 	/*
  191. 	if ( root->left != NULL ) {
  192. 		BTree * node = root->left;
  193. 		while ( node != NULL ) {
  194. 			if ( !last_left.empty() && node == last_left.top() ) {
  195. 				if  ( node->right != NULL ) {
  196. 					node = node->right;
  197. 				} else {
  198. 					cout<<node->data<<",";
  199. 					last_left.pop();
  200. 					if ( last_right.empty() )  return;
  201. 					node = last_right.top();
  202. 				}
  203. 			} else if ( node->left != NULL ) {
  204. 				last_left.push(node);
  205. 				if ( node->right != NULL ) {
  206. 					last_left.push( node->right );
  207. 				}
  208. 				node = node->left;
  209. 			} else if( node->right != NULL ) {
  210. 				node =  node->right;
  211. 			} else {
  212. 				cout<<node->data<<",";
  213. 				if ( last.empty() )  return;
  214. 				node = last.top();
  215. 			}
  216. 		}
  217. 	} else if ( root->right != NULL ) {
  218. 		BTree * node = root->right;
  219. 		while ( node != NULL ) {
  220. 			if ( !last_right.empty() && node == last_right.top() ) {
  221. 				if  ( node->right != NULL ) {
  222. 					node = node->right;
  223. 				} else {
  224. 					cout<<node->data<<",";
  225. 					last_right.pop();
  226. 					if ( last_right.empty() )  return;
  227. 					node = last_right.top();
  228. 				}
  229. 			} else if ( node->left != NULL ) {
  230. 				last_right.push(node);
  231. 				if ( node->right != NULL ) {
  232. 					last_right.push( node->right );
  233. 				}
  234. 				node = node->left;
  235. 			} else if( node->right != NULL ) {
  236. 				node =  node->right;
  237. 			} else {
  238. 				cout<<node->data<<",";
  239. 				if ( last.empty() )  return;
  240. 				node = last.top();
  241. 			}
  242. 		}
  243. 	}
  245. 	cout<<root->data<<endl;
  246. 	*/
  248. 	while ( node != NULL ) { 
  249. 		if( !last.empty() && node == last.top() ) {
  250. 			if ( node->right != NULL  ) {
  251. 				//last.push(node->left);
  252. 				node = node->right;
  253. 			}  else {
  254. 				cout<<node->data<<",";
  255. 				last.pop();
  256. 				if ( last.empty() )  return;
  257. 				node = last.top();
  258. 			}
  259. 			
  260. 		} else if ( node->left != NULL ) {
  261. 			last.push(node);
  262. 			node =  node->left;
  263. 		} else if ( node->right != NULL ) {
  264. 			//cout<<node->data<<",";
  265. 			node = node->right ;
  266. 		} else {
  267. 			cout<<node->data<<",";
  268. 			if ( last.empty() )  return;
  269. 			node = last.top();
  270. 		}
  271. 	}
  272. 	
  273. }
  276. int main(int argc, char* argv[])
  277. {
  278. 	
  279. 	BTree * root =create_node ( 6 ) ;
  280. 	BTree * &node = root ;
  281. 	//²åÈë(ÆÕͨ)
  282. 	insert_node ( root , 19 );
  283. 	insert_node ( root , 4 );
  284. 	//²åÈë(µÝ¹é)
  285. 	insert_node_recursive( root , 3 );
  286. 	//²åÈë(¶þ¼¶Ö¸Õë)
  287. 	insert_node_recursive_ptr2tptr(&root , 5 );
  288. 	//²åÈë(ÒýÓÃ)
  289. 	insert_node_recursive_reference (  node , 10 );
  291. 	cout<<"Ïȸù±éÀú(µÝ¹é)£º"<<endl;
  292. 	traversal_DLR_recursive ( root );
  293. 	cout<<endl<<"=============="<<endl;
  295. 	cout<<"Ïȸù±éÀú(·ÇµÝ¹é,Õ»¸¨Öú)£º"<<endl;
  296. 	traversal_DLR ( root );
  297. 	cout<<endl<<"=============="<<endl;
  299. 	cout<<"Öиù±éÀú(µÝ¹é)£º"<<endl;
  300. 	traversal_LDR_recursive ( root );
  301. 	cout<<endl<<"=============="<<endl;
  303. 	cout<<"Öиù±éÀú(·ÇµÝ¹é£¬Õ»¸¨Öú)£º"<<endl;
  304. 	traversal_LDR ( root );
  305. 	cout<<endl<<"=============="<<endl;
  307. 	cout<<"ºó¸ù±éÀú(µÝ¹é)£º"<<endl;
  308. 	traversal_LRD_recursive ( root );
  309. 	cout<<endl<<"=============="<<endl;
  311. 	cout<<"ºó¸ù±éÀú(·ÇµÝ¹é£¬Õ»¸¨Öú)£º"<<endl;
  312. 	traversal_LRD ( root );
  313. 	cout<<endl<<"=============="<<endl;
  315. 	return 0;
  316. }





posted @ 2015-10-08 22:30  fysola  阅读(224)  评论(0)    收藏  举报