Advanced Search

Posted By

igradeca on 01/19/15

Tagged

Versions (?)

Last Edited at 01/19/15 05:30am

Statistics

Viewed 872 times
Favorited by 0 user(s)

algoritmi_stabla.h

/ Published in: C++
Save to your folder(s)
Datoteka zaglavlja za "main_drvo.cpp" iz kolegija Strukture podataka, zadaća 4.
Algoritmi za obilazak stabla.

Expand | Embed | Plain Text

Copy this code and paste it in your HTML 
  1. #include<iostream>
  2. using namespace std;
  3.  
  4. void PreOrder(drvo *T){
  5.  
  6.      int pom= T-> korijen;
  7.      cout << pom << " ";
  8.  
  9.      if(T-> polje[pom].dijete!= -1){
  10.             T-> korijen= T-> polje[pom].dijete;
  11.             PreOrder(T);
  12.             }
  13.      if(T-> polje[pom].brat!= -1){
  14.             T-> korijen= T-> polje[pom].brat;
  15.             PreOrder(T);
  16.             }
  17.      }
  18.  
  19. void PostOrder(drvo *T){
  20.  
  21.      int pom= T-> korijen;
  22.      if(T-> polje[pom].dijete!= -1){
  23.             T-> korijen= T-> polje[pom].dijete;
  24.             PostOrder(T);
  25.             }
  26.  
  27.      cout << pom << " ";
  28.  
  29.      if(T-> polje[pom].brat!= -1){
  30.             T-> korijen= T-> polje[pom].brat;
  31.             PostOrder(T);
  32.             }
  33.      }
  34.  
  35. void InOrder(drvo *T){
  36.  
  37.      int pom= T-> korijen;
  38.      if(T-> polje[pom].dijete!= -1){
  39.             T-> korijen = T-> polje[pom].dijete;
  40.             InOrder(T);
  41.             }
  42.      if(T-> polje[pom].dijete== -1) cout << pom << " ";
  43.  
  44.      int parent = ParentT(pom, T);
  45.  
  46.      if(FirstChildT(parent, T)== pom) cout << parent << " ";
  47.      if(T-> polje[pom].brat!= -1){
  48.             T-> korijen = T-> polje[pom].brat;
  49.             InOrder(T);
  50.             }
  51.      }

Report this snippet


Comments

RSS Icon Subscribe to comments

You need to login to post a comment.