스레드 이진 트리 순회 프로그램

#include <stdio.h>

#define TRUE 1
#define FALSE 0

typedef struct TreeNode {
 int data;
 struct TreeNode *left, *right;
 int is_thread;
} TreeNode;

//           G

//      C        F

//   A   B   D   E

TreeNode n1 = { 'A', NULL, NULL, 1 };
TreeNode n2 = { 'B', NULL, NULL, 1 };
TreeNode n3 = { 'C', &n1, &n2, 0 };
TreeNode n4 = { 'D', NULL, NULL, 1 };
TreeNode n5 = { 'E', NULL, NULL, 0 };
TreeNode n6 = { 'F', &n4, &n5, 0 };
TreeNode n7 = { 'G', &n3, &n6, 0 };
TreeNode *exp = &n7;       //root

TreeNode *find_thread_successor(TreeNode *p)
{
 TreeNode *q = p->right;

 if(q==NULL || p->is_thread == TRUE)
  return q;
 while(q->left != NULL) q = q->left;
 return q;
}

void thread_inorder(TreeNode *t)
{
 TreeNode *q;
 q=t;
 while(q->left) q=q->left;
 do {
  printf("%c\n", q->data);
  q=find_thread_successor(q);
 } while(q);
}

void main()
{
 n1.right = &n3;
 n2.right = &n7;
 n4.right = &n6;

 //중위 순회
 thread_inorder(exp);
}