-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathRecursive_Level_order.cpp
More file actions
48 lines (38 loc) · 1 KB
/
Recursive_Level_order.cpp
File metadata and controls
48 lines (38 loc) · 1 KB
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
#include <stdio.h>
#include <stdlib.h>
struct Dugum {
int veri;
struct Dugum* sol;
struct Dugum* sag;
};
Dugum* yeniDugum(int veri) {
Dugum* dugum = (Dugum*)malloc(sizeof(Dugum));
dugum->veri = veri;
dugum->sol = dugum->sag = NULL;
return dugum;
}
int duzeyGetir(int aranan, Dugum* root) {
if (root == NULL)
return -1;
if (root->veri == aranan)
return 0;
int solDuzey = duzeyGetir(aranan, root->sol);
if (solDuzey != -1)
return solDuzey + 1;
int sagDuzey = duzeyGetir(aranan, root->sag);
if (sagDuzey != -1)
return sagDuzey + 1;
return -1;
}
int main() {
Dugum* root = yeniDugum(1);
root->sol = yeniDugum(2);
root->sag = yeniDugum(3);
root->sol->sol = yeniDugum(4);
root->sol->sag = yeniDugum(5);
root->sag->sol = yeniDugum(6);
root->sag->sag = yeniDugum(7);
int aranan = 3;
printf("Agacta aranan deger: %d \nAranan degerin seviyesi:%d",aranan,duzeyGetir(aranan, root));
return 0;
}