/** author : coder_zhang time : 2014-6-14 **/ #include <stdio.h> #include <stdlib.h> #include <string.h> #define MAX 100 #define ARRAY_SIZE(array, type) ((sizeof(array) / sizeof(type))) typedef struct node { int value; struct node* left; struct node* right; } node; /* 非递归后序遍历 */ void post_order(node* root) { node* stack[MAX]; int status[MAX]; int pos = -1; while (root != NULL) { stack[++pos] = root; status[pos] = 0; root = root->left; } while (pos != -1) { root = stack[pos]; if (root->right == NULL || status[pos] == 1) { --pos; fprintf(stderr, "%c ", root->value); } else { status[pos] = 1; root = root->right; while (root != NULL) { stack[++pos] = root; status[pos] = 0; root = root->left; } } } fprintf(stderr, " "); } /* 非递归前序遍历 */ void pre_order_view(node* root) { node* stack[MAX]; int pos = -1; while (root != NULL || pos != -1) { if (root == NULL) { root = stack[pos--]; } fprintf(stderr, "%c ", root->value); if (root->right != NULL) { stack[++pos] = root->right; } root = root->left; } fprintf(stderr, " "); } void pre_order_view_1(node* root) { if (root != NULL) { fprintf(stderr, "%c ", root->value); pre_order_view_1(root->left); pre_order_view_1(root->right); } } int index_char(const char* str, char ch) { int pos = 0; while (*str != '