#include <iostream>
#include <string.h>
#include <cstring>
#include <cstdio>
#include <cstdlib>
using namespace std;
int n,l;
typedef struct dataStruct{
dataStruct* left;
dataStruct* right;
int data;
}*node;
void CreatTree(node &T, int dt){
if(T == NULL){
T = new dataStruct();
T->data = dt;
T->left = NULL;
T->right = NULL;
return ;
}
if(T->data > dt){
CreatTree(T->left, dt);
}else{
CreatTree(T->right, dt);
}
}
bool isEqual(node t1,node t2){
if(t1 != NULL && t2 != NULL){
if(t1->data != t2->data){
return false;
#include <string.h>
#include <cstring>
#include <cstdio>
#include <cstdlib>
using namespace std;
int n,l;
typedef struct dataStruct{
dataStruct* left;
dataStruct* right;
int data;
}*node;
void CreatTree(node &T, int dt){
if(T == NULL){
T = new dataStruct();
T->data = dt;
T->left = NULL;
T->right = NULL;
return ;
}
if(T->data > dt){
CreatTree(T->left, dt);
}else{
CreatTree(T->right, dt);
}
}
bool isEqual(node t1,node t2){
if(t1 != NULL && t2 != NULL){
if(t1->data != t2->data){
return false;