在linux为什么会运行错误?而在windows正常

lluct

在linux下.运行时,"请问根结点是否有左子树?(Y/N):"和"请问根结点是否有右子树?(Y/N):"会同时出现,前面的根本没有输入.为什么?难道一个程序中不能出现两三个getchar或scanf??

1. 
   
2. #include <stdio.h>
   
3. 
   
4. typedef struct btnode
   
5. {
   
6.   int data;
   
7.   struct btnode *lchild;
   
8.   struct btnode *rchild;
   
9. } bitreptr;
   
10. 
    
11. bitreptr* create(bitreptr* root);
    
12. 
    
13. bitreptr* createHead()
    
14. {
    
15.   bitreptr *root;
    
16.   int input;
    
17.   char choose;
    
18.   root = (bitreptr *) malloc (sizeof(bitreptr));
    
19.   root -> lchild = NULL;
    
20.   root -> rchild = NULL;
    
21.   printf("输入根结点的数据:\t\t");
    
22.   scanf("%d", &input);
    
23.   root -> data = input;
    
24.   printf("请问根结点是否有左子树?(Y/N):\t");
    
25.   fflush(stdin);
    
26.   choose=getchar();
    
27.   if(choose=='Y' || choose=='y')
    
28.    root->lchild = create(root->lchild);
    
29.   printf("请问根结点是否有右子树?(Y/N):\t");
    
30.   fflush(stdin);
    
31.   choose=getchar();
    
32.   if(choose=='Y' || choose=='y')
    
33.    root -> rchild = create(root->rchild);
    
34. 
    
35.   return root;
    
36. }
    
37. 
    
38. bitreptr* create(bitreptr* root)
    
39. {
    
40.   int input;
    
41.   char choose;
    
42.   root = (bitreptr *) malloc (sizeof(bitreptr));
    
43.   root -> lchild = NULL;
    
44.   root -> rchild = NULL;
    
45.   printf("输入当前结点内的数据:\t\t");
    
46.   scanf("%d", &input);
    
47.   root -> data = input;
    
48.   printf("请问当前结点是否有左子树?(Y/N):\t");
    
49.   fflush(stdin);
    
50.   choose=getchar();
    
51.   if(choose=='Y' || choose=='y')
    
52.    root->lchild = create(root->lchild);
    
53.   printf("请问当前结点是否有右子树?(Y/N):\t");
    
54.   fflush(stdin);
    
55.   choose=getchar();
    
56.   if(choose=='Y' || choose=='y')
    
57.    root -> rchild = create(root->rchild);
    
58.   return (root);
    
59. }
    
60. 
    
61. void outputTree(bitreptr* pbnode,int totalSpace)
    
62. {int i;
    
63. if(pbnode!=NULL)
    
64. {
    
65.   totalSpace+=5;
    
66.   outputTree(pbnode->rchild,totalSpace);
    
67.   for(i=0;i<totalSpace;i++) printf(" ");
    
68.   printf("%d\n",pbnode->data);
    
69.   outputTree(pbnode->lchild,totalSpace);
    
70. }
    
71. }
    
72. 
    
73. void preorder (bitreptr *root)
    
74. {
    
75.   if (root == NULL)
    
76.     return;
    
77.   printf("%d ", root -> data);
    
78.   preorder(root -> lchild);
    
79.   preorder(root -> rchild);
    
80. }
    
81. 
    
82. void inorder (bitreptr *root)
    
83. {
    
84.   if (root == NULL)
    
85.     return;
    
86.   inorder(root -> lchild);
    
87.   printf("%d ", root -> data);
    
88.   inorder(root -> rchild);
    
89. }
    
90. 
    
91. void postorder (bitreptr *root)
    
92. {
    
93.   if (root == NULL)
    
94.     return;
    
95.   postorder(root -> lchild);
    
96.   postorder(root -> rchild);
    
97.   printf("%d ", root -> data);
    
98. }
    
99. 
    
100. int max(int a, int b)
     
101. {
     
102. if(a>=b) return a;
     
103. else return b;
     
104. }
     
105. 
     
106. int depth_bintree (bitreptr *root)
     
107. {
     
108.   int depth, depthl, depthr;
     
109.   if (root == NULL)
     
110.     depth = 0;
     
111.   else
     
112.     {
     
113.       depthl = depth_bintree(root -> lchild);
     
114.       depthr = depth_bintree(root -> rchild);
     
115.       depth = (max(depthl, depthr) + 1);
     
116.     }
     
117.   return (depth);
     
118. }
     
119. 
     
120. int countleaf (bitreptr *root)
     
121. {
     
122.   static int count=0;
     
123.   if ((root -> lchild == NULL) && (root -> rchild == NULL))
     
124.       count++;
     
125.   else if((root -> lchild != NULL) && (root -> rchild == NULL))
     
126.    countleaf(root -> lchild);
     
127.   else if((root -> lchild == NULL) && (root -> rchild != NULL))
     
128.       countleaf(root -> rchild);
     
129.   else if((root -> lchild != NULL) && (root -> rchild != NULL))
     
130.   {
     
131.    countleaf(root->lchild);
     
132.    countleaf(root->rchild);
     
133.   }
     
134.   return (count);
     
135. }
     
136. int countall(bitreptr *root)
     
137. {
     
138. static int count=0;
     
139. if((root -> lchild == NULL) && (root -> rchild == NULL))
     
140.   count++;
     
141. else if((root -> lchild != NULL) && (root -> rchild == NULL))
     
142. {
     
143.   count++;
     
144.   countall(root -> lchild);
     
145. }
     
146. else if((root -> lchild == NULL) && (root -> rchild != NULL))
     
147. {
     
148.   count++;
     
149.   countall(root -> rchild);
     
150. }
     
151. else if((root -> lchild != NULL) && (root -> rchild != NULL))
     
152. {
     
153.   count++;
     
154.   countall(root->lchild);
     
155.   countall(root->rchild);
     
156. }
     
157. return count;
     
158. }
     
159. 
     
160. int main ()
     
161. {
     
162.   bitreptr *root;
     
163.   int leaves,depth;
     
164.   int allnodes;
     
165.   int totalSpace=0;
     
166.   root = createHead();
     
167.   printf("我们构造的这棵二叉树的直观图为:\n");
     
168.   outputTree(root,totalSpace);
     
169.   printf("\n先根遍历:\n");
     
170.   preorder(root);
     
171.   printf("\n中根遍历:\n");
     
172.   inorder(root);
     
173.   printf("\n后根遍历:\n");
     
174.   postorder(root);
     
175.   depth = depth_bintree(root);
     
176.   printf("\n树的深度为:\t%d",depth);
     
177.   leaves = countleaf(root);
     
178.   printf("\n叶子总数为:\t%d", leaves);
     
179.   allnodes =countall(root);
     
180.   printf("\n总的结点数目为:\t%d\n",allnodes);
     
181. }
     

复制代码

kj501

这是因为unix的终端是行缓冲的。
http://www.linuxsir.cn/forum.php ... =%D0%D0%BB%BA%B3%E5

鱼儿小

fflush(stdin)，你刷新stdin流做什么？？