Advertisement
Guest User

Untitled

a guest
May 21st, 2018
127
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.65 KB | None | 0 0
  1. #include <iostream>
  2. #include <fstream>
  3. using namespace std;
  4. ifstream f("date.in");
  5. int st[101],dr[101],i,j,n,v[101],c=1;
  6. struct nod{
  7. int info;
  8. nod* st;
  9. nod* dr;
  10. };
  11. nod* v,z;
  12. int main(){
  13. f>>n;
  14. for(i=1;i<=n;i++){
  15. f>>v[i];
  16. }
  17. for(i=1;i<=n;i++){
  18. st[i]=v[2*i];
  19. dr[i]=v[2*i+1];
  20. cout<<v[i]<<" "<<st[i]<<" "<<dr[i]<< " " ;
  21. cout<<endl;
  22. }
  23. for(i=1;i<=n;i++){
  24. if(st[i]>v[i] || (dr[i]<v[i] &&dr[i])){
  25. c=0;
  26. break;
  27. }
  28. }
  29. if(c) cout<<"Arborele este de cautare";
  30. else cout<<"Arborele nu este de cautare";
  31. return 0;
  32. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement