#include<stdio.h>
#include<stdlib.h>
typedef char Type;
typedef struct Node{
Type val;
struct Node *lchild, *rchild;
int ltag, rtag;//0-thread, 1-link
}Node, *Bptr;
Bptr pre;
void InitialThread(Bptr *p){
*p = (Node*)malloc(sizeof(Node));
(*p)->lchild = NULL;
(*p)->rchild = NULL;
}
void CreatB(Node **p){
Type c;
scanf("%c", &c);
if(c == '#'){
*p = NULL;
线索二叉树(中序线索化,非递归遍历)
最新推荐文章于 2022-11-09 23:41:53 发布