xiaoyao_zhang的博客

#include<stdio.h> #include<stdlib.h> typedef struct BTNode { int data; int count; struct BTNode *lchild; struct BTNode *rchild; }BTNode; /* int insert(BTNode *&T,int key)//递归方...

前序和中序、中序和后序可唯一确定一棵二叉树。 前序和后序不可唯一确定一棵二叉树。 #include<iostream> #include<stdlib.h> #define maxSize 100 using namespace std; typedef struct BTNode { char data; struct BTNode *lchild;...

#include<iostream> #include<stdlib.h> #define maxSize 100 using namespace std; typedef struct BTNode { char data; struct BTNode *lchild; struct BTNode *rchild; }BTNode; void Visit(BTNo...

#include<iostream> #include<stdlib.h> #define maxSize 100 using namespace std; typedef struct BTNode { char data; struct BTNode *lchild; struct BTNode *rchild; }BTNode; void Visit(BTNo...