Advertisement
Guest User

Untitled

a guest
Feb 27th, 2020
93
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.58 KB | None | 0 0
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. ifstream fin("arbore2.txt");
  4. struct ARB{int nod;
  5. ARB *S, *D;};
  6. ARB *R;
  7. int n;
  8. void inserare(ARB *&c,int k)
  9. {
  10. if(c)
  11. {if(c->nod<k)
  12. inserare(c->D,k);
  13. else
  14. inserare(c->S,k);}
  15. else
  16. {c=new ARB;
  17. c->nod=k;
  18. c->S=c->D=NULL;}
  19. }
  20.  
  21. void SVD(ARB *a)
  22. {
  23. if(a)
  24. {
  25. SVD(a->S);
  26. cout<<a->nod<<" ";
  27. SVD(a->D);
  28. }
  29. }
  30. int main()
  31. {
  32. cout<<"Nod= ";
  33. cin>>n;
  34. while(n!=0)
  35. {
  36. inserare(R,n);
  37. cout<<"Nod= ";
  38. cin>>n;}
  39.  
  40.  
  41. cout<<"SVD = ";
  42. SVD(R);
  43. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement