Advertisement
Guest User

Untitled

a guest
Feb 18th, 2020
86
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.01 KB | None | 0 0
  1. //preordine
  2.  
  3. #include <iostream>
  4. #include <fstream>
  5. using namespace std;
  6. ifstream fin ("preordine.in");
  7. ofstream fout ("preordine.out");
  8. struct nod
  9. {
  10. int x, dr, st, ord;
  11. }v[1001];
  12. int n, t[1001],r;
  13. void preordine (int k)
  14. {
  15. if (k!=0)
  16. {
  17. fout << v[k].x << " ";
  18. preordine (v[k].st);
  19. preordine (v[k].dr);
  20. }
  21. }
  22.  
  23. int main()
  24. {
  25.  
  26. fin >> n;
  27. for (int i=1; i<=n; i++)
  28. {
  29. fin >> v[i].x >> v[i].st >> v[i].dr;
  30. t[v[i].st]=i;
  31. t[v[i].dr]=i;
  32. v[i].ord=i;
  33. }
  34. for (int i=1; i<=n; i++)
  35. {
  36. if (t[i]==0)
  37. r=i;
  38.  
  39. }
  40. preordine(r);
  41. return 0;
  42. }
  43.  
  44.  
  45. //inordine
  46. #include <iostream>
  47. #include <fstream>
  48. using namespace std;
  49. ifstream fin ("inordine.in");
  50. ofstream fout ("inordine.out");
  51. struct nod
  52. {
  53. int x, dr, st, ord;
  54. }v[1001];
  55. int n, t[1001],r;
  56. void preordine (int k)
  57. {
  58. if (k!=0)
  59. {
  60.  
  61. preordine (v[k].st);
  62. fout << v[k].x << " ";
  63.  
  64. preordine (v[k].dr);
  65.  
  66. }
  67. }
  68.  
  69. int main()
  70. {
  71.  
  72. fin >> n;
  73. for (int i=1; i<=n; i++)
  74. {
  75. fin >> v[i].x >> v[i].st >> v[i].dr;
  76. t[v[i].st]=i;
  77. t[v[i].dr]=i;
  78. v[i].ord=i;
  79. }
  80. for (int i=1; i<=n; i++)
  81. {
  82. if (t[i]==0)
  83. r=i;
  84.  
  85. }
  86. preordine(r);
  87. return 0;
  88. }
  89.  
  90.  
  91. //postordine
  92. #include <iostream>
  93. #include <fstream>
  94. using namespace std;
  95. ifstream fin ("postordine.in");
  96. ofstream fout ("postordine.out");
  97. struct nod
  98. {
  99. int x, dr, st, ord;
  100. }v[1001];
  101. int n, t[1001],r;
  102. void preordine (int k)
  103. {
  104. if (k!=0)
  105. {
  106.  
  107. preordine (v[k].st);
  108. preordine (v[k].dr);
  109. fout << v[k].x << " ";
  110.  
  111. }
  112. }
  113.  
  114. int main()
  115. {
  116.  
  117. fin >> n;
  118. for (int i=1; i<=n; i++)
  119. {
  120. fin >> v[i].x >> v[i].st >> v[i].dr;
  121. t[v[i].st]=i;
  122. t[v[i].dr]=i;
  123. v[i].ord=i;
  124. }
  125. for (int i=1; i<=n; i++)
  126. {
  127. if (t[i]==0)
  128. r=i;
  129.  
  130. }
  131. preordine(r);
  132. return 0;
  133. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement