-
Notifications
You must be signed in to change notification settings - Fork 0
/
Estrutura de Dados.c
95 lines (75 loc) · 1.62 KB
/
Estrutura de Dados.c
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
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
#include <stdio.h>
#include<stdlib.h>
typedef struct Node{
int data;
struct Node* left;
struct Node* right;
}; Node;
Node* insert(Node *root, int data) {
Node *temp = (Node*) malloc(sizeof(Node));
temp->data = data;
temp->left = NULL;
temp->right = NULL;
if (root == NULL) {
root = temp;
} else{
node *current = root;
node *perent = NULL;
while(1){
parent = current;
if (data < parent->data){
current = current->left;
if(current == NULL){
parent->left = temp;
return root;
}
} else{
current = current->right;
if(current == NULL)
parent->right =temp;
return root;
}
}
}
}
return root;
}
void inorder_traversal(struct Node* root){
if(root) {
inorder_traversal(root->left);
printf("%d", root->data);
inorder_traversal(root->right);
}
}
Node* search(Node *root, int data){
Node *current = root;
printf("Visiting elements: ");
while(current) {
printf("%d", current->data);
if (data , current->data) {
current = current->left;
} else if (data > current->data){
current = current->right;
} else {
return curretn;
}
}
}
int main(){
int i;
int array[14] =
{ 34, 84, 15, 0, 2, 99, 79, 9,
88, 89, 18, 31, 39, 100, 101}
Node *root = NULL;
for(i = 0; i < 13; i++){
root = insert(root, array[i]);
printf("Inserted: %d\n", array[i]);
}
int temp = serach(root, 88);
if(temp){
printf("[%d] Found.\n", temp->data);
}else{
printf("[x] (%d) Not found.\n", i);
}
return 0;
};