先访问根节点,然后先序遍历左子树,再先序遍历右子树(abdecfg)
代码void pre_order(struct BinTree_node * tree){
if(tree){
printf("%cn",&tree->elem);
pre_order(tree->ltree);
pre_order(tree->rtree);
}
}
中序遍历
先中序遍历左子树,再访问更节点,在中序遍历右子树(dbeafgc)
代码void in_order(struct BinTree_node * tree){
if(tree){
in_order(tree->ltree);
printf("%cn",tree->elem);
in_order(tree->rtree);
}
}
后序遍历
先后序遍历左子树,再后续遍历右子树,最后访问根节点(debgfca)
代码void pos_order(struct BinTree_node * tree){
if(tree){
pos_order(tree->ltree);
pos_order(tree->rtree);
printf("%cn",tree->elem);
}
}



