二叉树 之 中序遍历 (不使用栈和递归）

#include <stdio.h>
#include <stdlib.h>
struct node{
int data;
struct node* left;
struct node* right;
};
void traversal(struct node* root){
struct node *current, *pre;
if(root == NULL)
return ;
current = root;
while(current != NULL){
if(current->left == NULL){
printf(" %d ",current->data);
current = current->right;
}
else{//找到current的前驱节点
pre = current->left;
while(pre->right != NULL && pre->right != current)
pre = pre->right;
//将current结点作为其前驱节点的右孩子
if(pre->right == NULL){
pre->right = current;
current = current->left;
}
else{//恢复树的原有结构，更改right指针
pre->right = NULL;
printf(" %d ",current->data);
current = current->right;
}
}
}
}
struct node* newnode(int data){
struct node* node = (struct node*) malloc(sizeof(struct node));
node->data = data;
node->left = NULL;
node->right = NULL;
return (node);
}
int main(){
 /* 构建树结构如下：
            1
          /   \
        2      3
      /  \
    4     5
  */
struct node* root = newnode(1);
root->left = newnode(2);
root->right = newnode(3);
root->left->left = newnode(4);
root->left->right = newnode(5);
traversal(root);


return 0;
}