int main() {
Tree T;
int k = 2;
T = CreateBiTree(T);
// printf("the %dth in preorder : %c\n", k, KthPreOrder(T, k));
printf("the %dth in preorder : %c\n", k, PreNode(T, k));
}
ElemType PreNode(Tree T, int k) {
if(!T) {
return '#';
}
if(i==k) {
return T->data;
}
i++;
ElemType ch = PreNode(T->lchild, k);
if(ch != '#') {
return ch;
}
ch = PreNode(T->rchild, k);
if(ch != '#') {
return ch;
}
}
void deleteStudent(Student * student, Student * p) {
if (p == student) {
if (student->next != 0) {
p = p->next;
student->name = student->next->name;
student->code = student->next->code;
student->next = student->next->next;
free(p);
}
else {
student->name = "";
student->code = 0;
student->next = 0;
}
}
else if (p == lastPoint(student)) {
PreNode(student, p)->next = 0;
free(p);
}
else if(p != 0) {
PreNode(student, p)->next = ForNode(student, p);
free(p);
}
}
