/*前序遍历*/ void pre_tree(node *root) { if(root!=NULL) { printf("%c\t",root->ch); pre_tree(root->lchild); pre_tree(root->rchild); } }
void pre_tree(node *s){ if( s ){ printf(" %c ",s->data); pre_tree(s->lchild); pre_tree(s->rchild); } }
int main(){ node *root; int sum = 0; int a = 0; root = binary_tree_create(); pre_tree(root); printf("\n"); /*med_tree(root); printf("\n"); post_tree(root); printf("\n"); get_nodesum_global(root); printf("nodesum = %d\n",nodenum); a = get_nodesum_local(root); printf("localsum = %d\n",a); show_leaf(root); printf("\n"); int sum_leaf; sum_leaf = get_leaf_sum(root); printf("sum = %d\n",sum_leaf); tree_depth_global(root,1); printf("depth = %d\n",depth); int temp = tree_depth_local(root); printf(" %d \n",temp); */ a = get_nodesum_global(root); printf("a = %d\n",a); }
int main(int argc, char const *argv[]) { node *root=init_tree(); pre_tree(root); printf("\n"); mid_tree(root); printf("\n"); last_tree(root); printf("\n"); return 0; }