回答編集履歴
1
行数削減
test
CHANGED
|
@@ -38,23 +38,17 @@
|
|
|
38
38
|
|
|
39
39
|
|
|
40
40
|
|
|
41
|
-
void inorder(struct node*
|
|
41
|
+
void inorder(struct node *p) {
|
|
42
|
-
|
|
43
|
-
struct node *p = root;
|
|
44
42
|
|
|
45
43
|
while(p != NULL) {
|
|
46
44
|
|
|
47
45
|
push(p);
|
|
48
46
|
|
|
49
|
-
p = p->left;
|
|
50
|
-
|
|
51
|
-
|
|
47
|
+
for(p = p->left; p == NULL && !stackempty(); p = p->right) {
|
|
52
48
|
|
|
53
49
|
p = pop();
|
|
54
50
|
|
|
55
51
|
printf("%d\n", p->val);
|
|
56
|
-
|
|
57
|
-
p = p->right;
|
|
58
52
|
|
|
59
53
|
}
|
|
60
54
|
|