Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //preordine
- #include <iostream>
- #include <fstream>
- using namespace std;
- ifstream fin ("preordine.in");
- ofstream fout ("preordine.out");
- struct nod
- {
- int x, dr, st, ord;
- }v[1001];
- int n, t[1001],r;
- void preordine (int k)
- {
- if (k!=0)
- {
- fout << v[k].x << " ";
- preordine (v[k].st);
- preordine (v[k].dr);
- }
- }
- int main()
- {
- fin >> n;
- for (int i=1; i<=n; i++)
- {
- fin >> v[i].x >> v[i].st >> v[i].dr;
- t[v[i].st]=i;
- t[v[i].dr]=i;
- v[i].ord=i;
- }
- for (int i=1; i<=n; i++)
- {
- if (t[i]==0)
- r=i;
- }
- preordine(r);
- return 0;
- }
- //inordine
- #include <iostream>
- #include <fstream>
- using namespace std;
- ifstream fin ("inordine.in");
- ofstream fout ("inordine.out");
- struct nod
- {
- int x, dr, st, ord;
- }v[1001];
- int n, t[1001],r;
- void preordine (int k)
- {
- if (k!=0)
- {
- preordine (v[k].st);
- fout << v[k].x << " ";
- preordine (v[k].dr);
- }
- }
- int main()
- {
- fin >> n;
- for (int i=1; i<=n; i++)
- {
- fin >> v[i].x >> v[i].st >> v[i].dr;
- t[v[i].st]=i;
- t[v[i].dr]=i;
- v[i].ord=i;
- }
- for (int i=1; i<=n; i++)
- {
- if (t[i]==0)
- r=i;
- }
- preordine(r);
- return 0;
- }
- //postordine
- #include <iostream>
- #include <fstream>
- using namespace std;
- ifstream fin ("postordine.in");
- ofstream fout ("postordine.out");
- struct nod
- {
- int x, dr, st, ord;
- }v[1001];
- int n, t[1001],r;
- void preordine (int k)
- {
- if (k!=0)
- {
- preordine (v[k].st);
- preordine (v[k].dr);
- fout << v[k].x << " ";
- }
- }
- int main()
- {
- fin >> n;
- for (int i=1; i<=n; i++)
- {
- fin >> v[i].x >> v[i].st >> v[i].dr;
- t[v[i].st]=i;
- t[v[i].dr]=i;
- v[i].ord=i;
- }
- for (int i=1; i<=n; i++)
- {
- if (t[i]==0)
- r=i;
- }
- preordine(r);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement