Advertisement
Guest User

Untitled

a guest
Oct 17th, 2018
71
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.13 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <string.h>
  3. #include <math.h>
  4. #include <stdlib.h>
  5. int j=0;
  6. void preorder(int arr[][2], int i, int size, int j, int *aux){
  7. if(i>=size||i<=-1){
  8. return;
  9. }
  10. //printf("%d\n", i);
  11. aux[j] = i;
  12. j++;
  13. preorder(arr, arr[i][0], size, j, aux);
  14. preorder(arr, arr[i][1], size, j, aux);
  15. }
  16. void inorder(int arr[][2], int i, int size, int j, int *aux){
  17. if(i==size||i==-1){
  18. return;
  19. }
  20. inorder(arr, arr[i][0], size, j, aux);
  21. aux[j] = i;
  22. //printf("%d\n", aux[*j]);
  23. j++;
  24. inorder(arr, arr[i][1], size, j, aux);
  25. }
  26. void postorder(int arr[][2], int i, int size, int j, int *aux){
  27. if(i==size||i==-1){
  28. return;
  29. }
  30. postorder(arr, arr[i][0], size, j, aux);
  31. postorder(arr, arr[i][1], size, j, aux);
  32. aux[j] = i;
  33. //printf("%d\n", aux[*j]);
  34. j++;
  35. }
  36. int main() {
  37. int n, i;
  38. scanf("%d", &n);
  39. int arr[n][2];
  40. int aux[n];
  41. for(i=0;i<n;i++){
  42. scanf("%d %d", &arr[i][0], &arr[i][1]);
  43. }
  44. preorder(arr, 0, n, j, aux);
  45. for(i=0;i<n;i++){
  46. printf("%d\n",aux[i]);
  47. }
  48. return 0;
  49. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement