思路:
将二叉树的根节点传进去,再递归遍历左右子树。递归条件:传进去的根节点不能为空,if(root==NULL) return;
递归遍历类型:
先序遍历(根左右)中序遍历(左根右)后序遍历(左右根)
举例:
代码实现:
主函数测试代码:
#include <iostream>
using namespace std;
typedef struct My_tree {
char data;
struct My_tree* lson;
struct My_tree* rson;
}mytree;
void Circle(mytree* root);
//创建二叉树
void Create_tree() {
mytree node1 = { 'A',NULL,NULL };
mytree node2 = { 'B',NULL,NULL };
mytree node3 = { 'C',NULL,NULL };
mytree node4 = { 'D',NULL,NULL };
mytree node5 = { 'E',NULL,NULL };
mytree node6 = { 'F',NULL,NULL };
mytree node7 = { 'G',NULL,NULL };
mytree node8 = { 'H',NULL,NULL };
node1.lson = &node2;
node1.rson = &node6;
node2.rson = &node3;
node3.lson = &node4;
node3.rson = &node5;
node6.rson = &node7;
node7.lson = &node8;
Circle(&node1);
}
//递归遍历
void Circle(mytree *root) {
if (root == NULL) {
return;
}
//先序遍历 根左右
/*cout<<root->data;
Circle(root->lson);
Circle(root->rson);*/
//中序遍历 左根右
/*Circle(root->lson);
cout << root->data;
Circle(root->rson);*/
//后序遍历 左右根
Circle(root->lson);
Circle(root->rson);
cout << root->data;
}
int main() {
Create_tree();
return 0;
}
运行截图: