#include?“binarytree.h“

/**?\brief?This?function?visit?each?node?of?the?binary?tree?in?a?preorder?traversal
?*??????????1.visit?the?node;?2.traverse?the?left?subtree;?3.traverse?the?right?subtree
?*
?*?\param?root:?pointer?to?the?root?node?of?the?binary?tree
?*?\param?visit_func:?pointer?to?the?function?to?call?for?each?node?visited
?*?\param?user_data:?user?data?to?pass?to?the?function
?*?\return?none
?*
?*/
//前序遍歷二叉樹，遍歷過程中，調用訪問函數visit_func訪問節點內部數據元素。
//參數user_data作為訪問函數visit_func的傳入參數，可以攜帶內容，豐富訪問操作。若棄用，則傳入NULL。
void?btree_traverse_preorder（BTNode?*root?VisitFunc?visit_func?void?*user_data）
{
#ifdef?USING_RECURSION
????if（root?==?NULL）?return;
????if（visit_func）{
????????visit_func（root?user_data）;
????}
????btree_traverse_preorder（root->left_child?visit_func?user_data）;
????btree_traverse_preorder（root->right_child?visit_func?user_data）;
#else
????BTNode?*current_node;
????Stack?*stack;

????if（root?==?NULL）?return;
????stack?=?stack_create（）;
????stack_push（stack?root）;
????while（stack_pop（stack?（void?**）¤t_node）?==?RET_OK）{
????????if（current_node->right_child）{
????????????stack_push（stack?current_node->right_child）;
????????}
????????if（current_node->left_child）{
????????????stack_push（stack?current_node->left_child）;
????????}
????????if（visit_func）{
????????????visit_func（current_node?user_data）;
????????}
????}

????stack_destroy（stack）;
#endif
}

/**?\brief?This?function?visit?each?node?of?the?binary?tree?in?a?inorder?traversal
?*??????????1.traverse?the?left?subtree;?2.visit?the?node;?3.traverse?the?right?subtree
?*
?*?\param?root:?pointer?to?the?root?node?of?the?binary?tree
?*?\param?visit_func:?pointer?to?the?function?to?call?for?each?node?visited
?*?\param?user_data:?user?data?to?pass?to?the?function
?*?\return?none
?*
?*/
//中序遍歷二叉樹，遍歷過程中，調用訪問函數visit_func訪問節點內部數據元素。
//參數user_data作為訪問函數visit_func的傳入參數，可以攜帶內容，豐富訪問操作。若棄用，則傳入NULL。
void?btree_traverse_inorder（BTNode?*root?VisitFunc?visit_func?void?*user_data）
{
#ifdef?USING_RECURSION
????if（root?==?NULL）?return;
????btree_traverse_inorder（root->left_child?visit_func?user_data）;
????if（visit_func）{
????????visit_func（root?user_data）;
????}
????btree_traverse_inorder（root->right_child?visit_func?user_data）;
#else
????BTNode?*current_node;
????Stack?*stack;

????if（root?==?NULL）?return;
????stack?=?stack_create（）;
????current_node?=?root;
????while（current_node?!=?NULL?||?stack_count_depth（stack）?>?0）{
????????if（current_node?!=?NULL）{
????????????stack_push（stack?current_node）;
????????????current_node?=?current_node->left_child;
????????}else{
????????????stack_pop（stack?（void?**）¤t_node）;
????????????if（visit_func）{
????????????????visit_func（current_node?user_data）;
????????????}
????????????current_node?=?current_node->right_child;
????????}
????}

????stack_destroy（stack）;
#endif?//?USING_RECURSION
}

/**?\brief?This?function?visit?each?node?of?the?binary?tree?in

?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----
?????目錄???????????0??2018-12-27?15:05??.vs\
?????目錄???????????0??2018-12-27?15:05??.vs\Kruskal\
?????目錄???????????0??2018-12-27?15:05??.vs\Kruskal\v15\
?????文件???????65024??2018-12-10?16:34??.vs\Kruskal\v15\.suo
?????文件?????2043904??2018-12-10?16:34??.vs\Kruskal\v15\Browse.VC.db
?????目錄???????????0??2018-12-27?15:05??.vs\Kruskal\v15\ipch\
?????目錄???????????0??2018-12-27?15:05??.vs\Kruskal\v15\ipch\AutoPCH\
?????目錄???????????0??2018-12-27?15:05??.vs\Kruskal\v15\ipch\AutoPCH\21ef5de3d1fdf1c2\
?????文件?????1966080??2018-12-10?16:32??.vs\Kruskal\v15\ipch\AutoPCH\21ef5de3d1fdf1c2\MAIN.ipch
?????目錄???????????0??2018-12-27?15:05??.vs\Kruskal\v15\ipch\AutoPCH\6b6f05537c908cbd\
?????文件?????3538944??2018-12-06?15:53??.vs\Kruskal\v15\ipch\AutoPCH\6b6f05537c908cbd\GRAPH.ipch
?????目錄???????????0??2018-12-27?15:05??.vs\Kruskal\v15\ipch\AutoPCH\6b8d9b537caa892e\
?????文件?????2293760??2018-12-05?10:22??.vs\Kruskal\v15\ipch\AutoPCH\6b8d9b537caa892e\GRAPH.ipch
?????目錄???????????0??2018-12-27?15:05??.vs\Kruskal\v15\ipch\AutoPCH\9beb1942cf6d9de8\
?????文件?????3604480??2018-12-05?18:01??.vs\Kruskal\v15\ipch\AutoPCH\9beb1942cf6d9de8\BINARYTREE.ipch
?????目錄???????????0??2018-12-27?15:05??.vs\Kruskal\v15\ipch\AutoPCH\c946e4776ea78650\
?????文件?????3538944??2018-12-05?23:20??.vs\Kruskal\v15\ipch\AutoPCH\c946e4776ea78650\SLIST.ipch
?????目錄???????????0??2018-12-27?15:05??.vs\Kruskal\v15\ipch\AutoPCH\c966f9fc9907b8f8\
?????文件?????3604480??2018-12-05?23:20??.vs\Kruskal\v15\ipch\AutoPCH\c966f9fc9907b8f8\QUEUE.ipch
?????目錄???????????0??2018-12-27?15:05??.vs\Kruskal\v15\ipch\AutoPCH\e81562c6613ea037\
?????文件?????3604480??2018-12-05?23:16??.vs\Kruskal\v15\ipch\AutoPCH\e81562c6613ea037\STACK.ipch
?????目錄???????????0??2018-12-27?15:05??.vs\Kruskal\v15\ipch\AutoPCH\ef333eb252170370\
?????文件?????3604480??2018-12-10?16:32??.vs\Kruskal\v15\ipch\AutoPCH\ef333eb252170370\KRUSKAL.ipch
?????目錄???????????0??2018-12-27?15:05??.vs\Kruskal\v15\ipch\AutoPCH\ef58a0b25236c633\
?????文件?????4390912??2018-12-05?16:14??.vs\Kruskal\v15\ipch\AutoPCH\ef58a0b25236c633\KRUSKAL.ipch
?????目錄???????????0??2018-12-27?15:05??.vs\Kruskal\v16\
?????文件???????64000??2018-12-27?13:44??.vs\Kruskal\v16\.suo
?????目錄???????????0??2018-12-27?15:05??.vs\Kruskal\v16\Preview\
?????文件?????2043904??2018-12-27?13:44??.vs\Kruskal\v16\Preview\Browse.VC.db
?????目錄???????????0??2018-12-27?15:05??.vs\Kruskal\v16\Preview\ipch\
?????目錄???????????0??2018-12-27?15:05??.vs\Kruskal\v16\Preview\ipch\AutoPCH\
............此處省略45個文件信息