Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <string.h>
- #include <math.h>
- #include <stdlib.h>
- int j=0;
- void preorder(int arr[][2], int i, int size, int j, int *aux){
- if(i>=size||i<=-1){
- return;
- }
- //printf("%d\n", i);
- aux[j] = i;
- j++;
- preorder(arr, arr[i][0], size, j, aux);
- preorder(arr, arr[i][1], size, j, aux);
- }
- void inorder(int arr[][2], int i, int size, int j, int *aux){
- if(i==size||i==-1){
- return;
- }
- inorder(arr, arr[i][0], size, j, aux);
- aux[j] = i;
- //printf("%d\n", aux[*j]);
- j++;
- inorder(arr, arr[i][1], size, j, aux);
- }
- void postorder(int arr[][2], int i, int size, int j, int *aux){
- if(i==size||i==-1){
- return;
- }
- postorder(arr, arr[i][0], size, j, aux);
- postorder(arr, arr[i][1], size, j, aux);
- aux[j] = i;
- //printf("%d\n", aux[*j]);
- j++;
- }
- int main() {
- int n, i;
- scanf("%d", &n);
- int arr[n][2];
- int aux[n];
- for(i=0;i<n;i++){
- scanf("%d %d", &arr[i][0], &arr[i][1]);
- }
- preorder(arr, 0, n, j, aux);
- for(i=0;i<n;i++){
- printf("%d\n",aux[i]);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement