Advertisement
Guest User

Untitled

a guest
Apr 27th, 2018
75
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.70 KB | None | 0 0
  1. #include <fstream>
  2. using namespace std;
  3.  
  4. ifstream fin("preordine.in");
  5. ofstream fout("preordine.out");
  6.  
  7. struct nod{
  8. int val, st, dr;
  9. }v[1001];
  10.  
  11. int n;
  12.  
  13. int radacina()
  14. {
  15. int x[1001] = {0};
  16. for(int i=1; i<=n ;i++)
  17. {
  18. x[v[i].st] = 1;
  19. x[v[i].dr] = 1;
  20. }
  21.  
  22. for(int i=1; i<=n; i++)
  23. if(x[i] == 0)
  24. return i;
  25. }
  26.  
  27. void preordine(int k)
  28. {
  29. if(k > 0)
  30. {
  31. fout << v[k].val << " ";
  32. preordine(v[k].st);
  33. preordine(v[k].dr);
  34. }
  35.  
  36. }
  37.  
  38. int main()
  39. {
  40. fin >> n;
  41. for(int i=1; i<=n; i++)
  42. {
  43. fin >> v[i].val >> v[i].st >> v[i].dr;
  44. }
  45.  
  46. preordine(radacina());
  47.  
  48. return 0;
  49. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement