-
Notifications
You must be signed in to change notification settings - Fork 1
/
DataStructure_TreeBySLL.cpp
77 lines (66 loc) · 1.38 KB
/
DataStructure_TreeBySLL.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
#include<stdio.h>
#include<stdlib.h>
#include<conio.h>
typedef int DataType;
typedef struct ListType{
DataType data;
ListType *next;
};
ListType *List;
int Size = 0;
void CreateTree(){
printf("Input number of node(s): ");
scanf("%d",&Size);
List = (ListType*) malloc (Size*sizeof(ListType));
for(int i = 0; i<Size; i++){
int data;
printf("Data of parent node %d: ",i+1);
scanf("%d",&data);
(&List[i])->data = data;
ListType *checkpoint;
checkpoint = &List[i];
int flag = 1;
while(flag == 1){
printf("Have another children? 1 or 0\n");
fflush(stdin);
scanf("%d",&flag);
if(flag == 1){
ListType *temp = NULL;
temp = (ListType*) malloc (sizeof(ListType));
printf("Input data: ");
int data;
scanf("%d",&data);
temp->data = data;
temp->next = NULL;
checkpoint->next = temp;
}
checkpoint = checkpoint->next;
}
}
}
ListType *Parent(DataType x){
ListType *temp, *temp0;
for(int i = 0; i < Size; i++){
temp0 = &List[i];
temp = (&List[i])->next;
while(temp->data != x && temp->next != NULL){
temp = temp->next;
}
if(temp->data == x) break;
}
return temp0;
}
void Print(){
for(int i = 0; i < Size; i++){
printf("Parent: %d ",(&List[i])->data);
}
}
int main(){
CreateTree();
Print();
printf("Find parent of? ");
int fp;
scanf("%d",&fp);
printf("Parent of %d : %d",fp,*Parent(fp));
free(List);
}