jQuery鼠标指针特效

二叉树--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
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
#include <stdio.h>
#include <stdlib.h>
struct node {
    int             value;
    struct node*    left;
    struct node*    right;
};
typedef struct node  NODE;//结构体变量
typedef struct node* PNODE;//结构体指针
void new_node (PNODE* n, int value) {
 
    *n = (PNODE)malloc (sizeof(NODE));
    if (*n != NULL) {
        (*n)->value  = value;
        (*n)->left   = NULL;
        (*n)->right = NULL;
    }
}
void free_node (PNODE* n) {
    if ((*n) != NULL) {
        free (*n);
        *n = NULL;
    }
}
void free_tree (PNODE* n) {
    if (*n == NULL) return;
    if ((*n)->left != NULL) {
        free_tree (&((*n)->left));
    }
    if ((*n)->right != NULL) {
        free_tree (&((*n)->right));
    }
    free_node (n);
}
//查找结点
PNODE find_node (PNODE n, int value) {
    if (n == NULL) {
        return NULL;
    } else if (n->value == value) {
        return n;
    } else if (value <= n->value) {
        return find_node (n->left, value);
    } else {
        return find_node (n->right, value);
    }
}
//插入结点
void insert_node (PNODE* n, int value) {
    if (*n == NULL) {
        new_node (n, value);
    } else if (value == (*n)->value) {
        return;
    } else if (value < (*n)->value) {
        insert_node (&((*n)->left), value);
    } else {
        insert_node (&((*n)->right), value);
    }
}
//最长路径
int get_max_depth (PNODE n) {
  int left = 0;
  int right = 0;
        if (n == NULL) {
        return 0;
    }
        if (n->left != NULL) {
        left = 1 + get_max_depth (n->left);
    }
    if (n->right != NULL) {
        right = 1 + get_max_depth (n->right);
    }
    return (left > right ? left : right );
}
//最短路径
int get_min_depth (PNODE n) {
  int left = 0;
  int right = 0;
    if (n == NULL) {
        return 0;
    }
    if (n->left != NULL) {
        left = 1 + get_min_depth (n->left);
    }
    if (n->right != NULL) {
        right = 1 + get_min_depth (n->right);
    }
    return (left < right ? left : right );
}
int get_num_nodes (PNODE n) {
  int left = 0;
  int right = 0;
    if (n == NULL) {
        return 0;
    }
    if (n->left != NULL) {
        left = get_num_nodes (n->left);
    }
    if (n->right != NULL) {
        right = get_num_nodes (n->right);
    }
    return (left + 1 + right);
}
//最短路径长度
int get_min_value (PNODE n) {
    if (n == NULL) return 0;
    if (n->left == NULL) {
        return n->value;
    } else {
        return get_min_value(n->left);
    }
}
//最长路径长度
int get_max_value (PNODE n) {
    if (n == NULL) return 0;
    if (n->right == NULL) {
        return n->value;
    } else {
        return get_max_value(n->right);
    }
}
//删除结点
void deletenode (PNODE *n) {
    PNODE tmp = NULL;
    if (n == NULL) return;
    if ((*n)->right == NULL) {
        tmp = *n;
        *n = (*n)->left;
        free_node (n);
    } else if ((*n)->left == NULL) {
        tmp = *n;
        *n = (*n)->right;
        free_node (n);
    } else {
        for (tmp = (*n)->right; tmp->left != NULL; tmp = tmp->left);
        tmp->left = (*n)->left;
        tmp = (*n);
        *n = (*n)->right;
        free_node (&tmp);
    }
}
void delete_node (PNODE *n, int value) {
    PNODE node;
    if (n == NULL) return;
    node = find_node (*n, value);
    if ((*n)->value == value) {
        deletenode (n);
    } else if (value < (*n)->value) {
        delete_node (&((*n)->left), value);
    } else {
        delete_node(&((*n)->right), value);
    }
}
void pre_order_traversal(PNODE n)
{
    if (n != NULL) {
        printf ("%i ", n->value);
        pre_order_traversal (n->left);
        pre_order_traversal( n->right);
    }
}
void in_order_traversal (PNODE n)
{
    if (n != NULL) {
        in_order_traversal (n->left);
        printf ("%i ", n->value);
        in_order_traversal ( n->right);
    }
}
void post_order_traversal (PNODE n)
{
    if (n != NULL) {
        post_order_traversal (n->left);
        post_order_traversal (n->right);
        printf ("%i ", n->value);
    }
}
int main() {
    char buf[50];
    int  option;
    PNODE tree = NULL;
    PNODE node = NULL;
        while (1) {
        printf ("--------------------------\n");
        printf ("Options are:\n\n");
        printf (" 0  Exit\n");
        printf (" 1  Insert node\n");
        printf (" 2  Delete node\n");
        printf (" 3  Find node\n");
        printf (" 4  Pre order traversal\n");
        printf (" 5  In order traversal\n");
        printf (" 6  Post order traversal\n");
        printf (" 7  Max depth\n");
        printf (" 8  Min depth\n");
        printf (" 9  Max value\n");
        printf (" 10 Min value\n");
        printf (" 11 Node Count\n\n");
        printf ("--------------------------\n");
        printf ("Select an option: ");
        fgets (buf, sizeof(buf), stdin);
        sscanf (buf, "%i", &option);
        printf ("--------------------------\n");
        if (option < 0 || option > 11) {
            fprintf (stderr, "Invalid option");
            continue;
        }
            switch (option) {
            case 0:
                exit (0);
            case 1:
                printf ("Enter number to insert: ");
                fgets (buf, sizeof(buf), stdin);
                sscanf (buf, "%i", &option);
                printf ("\n\n");
                insert_node (&tree, option);
                break;
            case 2:
                printf ("Enter number to delete: ");
                fgets (buf, sizeof(buf), stdin);
                sscanf (buf, "%i", &option);
                printf ("\n\n");
                delete_node (&tree, option);
                break;
            case 3:
                printf ("Enter number to find: ");
                fgets (buf, sizeof(buf), stdin);
                sscanf (buf, "%i", &option);
                printf ("\n\n");
                node = find_node (tree, option);
                if (node != NULL) {
                    printf ("Found node\n\n");
                } else {
                    printf ("Couldn't find node\n\n");
                }
                break;
            case 4:
                printf ("Pre order traversal: ");//前序遍历
                pre_order_traversal (tree);
                printf ("\n\n");
                break;
            case 5:
                printf ("In order traversal: ");//中序遍历
                in_order_traversal (tree);
                printf ("\n\n");
                break;
            case 6:
                printf ("Post order traversal: ");//后序遍历
                post_order_traversal (tree);
                printf ("\n\n");
                break;
            case 7:
                printf ("Max depth is %i\n\n", get_max_depth (tree));
                break;
            case 8:
                printf ("Min depth is %i\n\n", get_min_depth (tree));
                break;
            case 9:
                printf ("Max value is %i\n\n", get_max_value (tree));
                break;
            case 10:
                printf ("Min value is %i\n\n", get_min_value (tree));
                break;
            case 11:
                printf ("Node Count is %i\n\n", get_num_nodes (tree));
                break;
        }
    }
    return 0;
}

  

posted @   僵小七  阅读(25)  评论(0编辑  收藏  举报
相关博文:
阅读排行:
· 微软正式发布.NET 10 Preview 1:开启下一代开发框架新篇章
· 没有源码,如何修改代码逻辑?
· NetPad:一个.NET开源、跨平台的C#编辑器
· PowerShell开发游戏 · 打蜜蜂
· 凌晨三点救火实录:Java内存泄漏的七个神坑,你至少踩过三个!
点击右上角即可分享
微信分享提示