線索二叉樹的遍歷(數據結構)

#include<stdio.h> #include<stdlib.h> #define ERROR 0 #define OK 1 #define OVERFLOW -2 typedef int Status; typedef char TElemType; typedef enum {Link,Thread} PointerTag; typedef struct BiThrNode {

>>阅读原文<<